Upper and lower bounds for the energy of bipartite graphs

72 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The energy of graphs and matrices (2006, unknown): “, [2], [8], [10], [11], [12], [13], and [14]).”
On the energy of some circulant graphs (2006, background): “4 of [15] generalises a result of [7].”
ON SPECTRAL MOMENTS AND ENERGY OF GRAPHS (2007, background): “For bipartite graphs it has been reported in [13, 25], whereas for all (both bipartite and non-bipartite) graphs in [16, 41].”
Energy of a Graph (2006, background): “In [8] and [10], high energy bipartite graphs are investigated with results similar to those for the non-bipartite case.”
Randic Matrix and Randic Energy (2010, background): “Results analogous to Theorem 5 were earlier reported for the ordinary graph energy [38–41].”
On sum of powers of the Laplacian eigenvalues of graphs (2008, unknown): “Lemma 8 [14,17].”
Beyond graph energy: norms of graphs and matrices (2015, background): “33 was proved by Rada and Tineo in [42], and by Zhou in [50], and later rediscovered several times:”
On graphs whose energy exceeds the number of vertices (2008, methodology): “Our starting point is the inequality E(G) √ (M2)3 M4 (4) that seems to be first given by Rada and Tineo [11], and has recently been utilized also in [13].”