The energy of a graph: Old and new results
Let \(G\) be a schlicht graph with \(n\) vertices and \(m\) edges. Its square adjacency matrix of order \(n\) be denoted by \(A= A(G)\). The zeros \(x_j\) of the characteristic polynomial \(\Phi(G,x)= \text{det}(xI- A(G))\) (here the unit matrix of order \(n\) is denoted by \(I\)) are said to be the eigenvalues of \(G\). The collection of all eigenvalues of \(G\) forms the spectrum of \(G\), and the energy \(E= E(G)\) is defined to be the sum of the absolute values of the eigenvalues of \(G\): \[ E= \sum^n_{j=1}|x_j|. \] Within quantum-chemistry the Hückel molecular orbital theory enables (with the help of the so-called Hückel-graph \(\widehat H\)) to calculate the total energy \(E_\pi\) of the so-called \(\pi\)-electrons from the molecular orbital energy levels \(E_j\), \(j= 1,\dots, n\). And in the present paper the relation between \(E\) and \(E_\pi\) of the class of organic molecules is briefly characterized. Therefore here some already long-known and also recently obtained interesting mathematical results on \(E\) are presented which are applicable in the Hückel theory. So Theorem 4.1 yields a representation of \(E\) by an improper integral of a term depending on \(n\), \(\Phi(G, ix)\), and \(\Phi'(G, ix)\) (Coulson integral formula of 1940). Combining this formula with a theorem of Sachs, the author gets insight into the dependence of \(E(G)\) on the structure of this graph. For example, it follows that \(E(S_n)< E(T_n)< E(P_n)\), where \(S_n\), \(T_n\) and \(P_n\) denote the star, the tree and the path on \(n\) vertices each. Furthermore, starting from a 1971 result of McClelland (Theorem 5.1) lower and upper bounds for \(E\) depending on \(n\) and \(m\) are found. For example: (1) For \(G\) containing \(m\) edges holds \(2\sqrt m\leq E(G)\leq 2m\) (Corollary 5.3). Case \(E= 2\sqrt m\) holds iff \(G\) is a complete bipartite graph plus arbitrarily many isolated vertices; case \(E= 2m\) holds iff \(G\) consists of \(m\) isolated edges and of arbitrarily many isolated vertices. (2) If \(G\) is an \(n\)-vertex graph without isolated vertices, then \(E(G)\geq 2\sqrt{n-1}\), with equality iff \(G\) is an \(n\)-vertex star (Theorem 5.4). Still further estimates are given in the paper. Finally, in Section 7, graphs with maximal energy (hyperenergetic graphs) are investigated. Out of former investigations the opinion resulted that the energy \(E(K_n)= 2n-2\) of the complete graph \(K_n\) is the maximal one of all \(n\)-vertex graphs. But later the existence of \(n\)-vertex graphs \(G\) with \(E(G)> E(K_n)\) could be shown, and therefore such graphs \(G\) with \(E(G)> 2n-2\) are said to be hyperenergetic, for example, the line graph of \(K_n\), \(n\geq 5\) (Proposition 7.2). Or take \(K_n\) for \(n\geq 3\). Let \(v\) be a vertex of \(K_n\) and let \(e_i\), \(i=1,\dots, r\), \(1\leq r\leq n-1\) be edges of \(K_n\), all incident to \(v\). The graph obtained by deleting \(e_i\), \(i= 1,\dots, r\), from \(K_n\) be denoted by \(K^r_n\). Then the following main result holds (Theorem 7.6): The energy of \(K^r_n\) exceeds the energy of \(K_n\) for \(r=2\) and \(n\geq 10\); \(r=3\) and \(n\geq 9\); \(r=4\) and \(n\geq 9\); \(r=5\) and \(n\geq 10\); \(r\geq 6\) and \(n\geq r+4\). Additional examples are given, but the characterization of \(n\)-vertex graphs with maximal value of \(E\) is still an open problem. For the entire collection see [Zbl 0961.00017].
- Energy of graphs and its new bounds
- Some new results on energy of graphs
- New bounds on the energy of a graph
- On the energy of graphs
- scientific article; zbMATH DE number 5005350
- scientific article; zbMATH DE number 7410314
- On energy of graphs
- scientific article; zbMATH DE number 1539552
- Some new lower bounds for energy of graphs
- A new lower bound for the energy of graphs
- On the sum of \(k\) largest eigenvalues of graphs and symmetric matrices
- Some relations between rank, chromatic number and energy of graphs
- A note on sum of powers of the Laplacian eigenvalues of bipartite graphs
- Chemical trees minimizing energy and Hosoya index
- On bipartite graphs with minimal energy
- Polygonal chains with minimal energy
- Upper and lower bounds for the energy of bipartite graphs.
- Energy of Pythagorean fuzzy graphs with applications
- Signless Laplacian energy of a graph and energy of a line graph
- Lower bounds for the energy of graphs
- Further results on color energy of graphs
- Bounds for the signless Laplacian energy of digraphs
- On the minimal matching energies of unicyclic graphs
- On the incidence energy of some toroidal lattices
- Solutions to unsolved problems on the minimal energies of two classes of trees
- Distance powers of unitary Cayley graphs
- A method for computing local contributions to graph energy based on Estrada-Benzi approach
- Bicyclic signed graphs with at most one odd cycle and maximal energy
- On line graphs with maximum energy
- Bounds related to Coxeter spectral measures of graphs
- Sharp upper bounds on the distance energies of a graph
- Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
- Energy of a vertex
- Unicyclic graphs with maximal energy
- A sharp upper bound on the incidence energy of graphs in terms of connectivity
- The proof of a conjecture on the comparison of the energies of trees
- Decision-making approaches based on color spectrum and D-TOPSIS method under rough environment
- Energy, matching number and odd cycles of graphs
- On the ordering of bicyclic digraphs with respect to energy and iota energy
- Energy of double dominating bipolar fuzzy graphs
- On maximal energy of line graphs with given parameters
- On conjectures of network distance measures by using graph spectra
- On Laplacian equienergetic signed graphs
- Energy of nonsingular graphs: improving lower bounds
- Adjacency matrix and Wiener index of zero divisor graph \(\varGamma (Z_n)\)
- Lower bounds on matching energy of graphs
- Improved McClelland and Koolen-Moulton bounds for distance energy of a graph
- Barabasi-Albert trees are hypoenergetic
- On spectra of distance Randić matrix of graphs
- An (increasing) sequence of lower bounds for the spectral radius and energy of digraphs
- On the normalized distance Laplacian eigenvalues of graphs
- Group decision-making framework under linguistic \(q\)-rung orthopair fuzzy Einstein models
- The distance Randić matrix of connected graphs
- Graph invariants of the line graph of zero divisor graph of \(\mathbb{Z}_n \)
- Adjacency energy of hypergraphs
- On the Sombor characteristic polynomial and Sombor energy of a graph
- Bounds on the \(ABC\) spectral radius and \(ABC\) energy of graphs
- On generalized distance energy of graphs
- On the degeneracy of the Randić entropy and related graph measures
- Integral equienergetic non-isospectral unitary Cayley graphs
- The minimal randić energy of trees with given diameter
- The skew energy of a digraph
- Some results on energy of unicyclic graphs with \(n\) vertices
- A new lower bound for the energy of graphs
- Bounds for the energy of weighted graphs
- Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs
- Properties of graph distance measures by means of discrete inequalities
- Energy conditions for Hamiltonicity of graphs
- Minimum covering reciprocal distance signless Laplacian energy of graphs
- A note on normalized Laplacian energy of graphs
- On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3
- Bipartite unicyclic graphs with large energies
- Quadratic unitary Cayley graphs of finite commutative rings
- On the minimal energy of graphs
- On the bounds for signless Laplacian energy of a graph
- Unicyclic signed graphs with minimal energy
- Bounds on the distance energy and the distance Estrada index of strongly quotient graphs
- Bounds for the Hückel energy of a graph
- Estimating the Estrada index
- On bicyclic graphs with maximal energy
- Minimality considerations for graph energy over a class of graphs
- What is the meaning of the graph energy after all?
- Minimal skew energy of oriented unicyclic graphs with a perfect matching
- Color signless Laplacian energy of graphs
- Spectral complexity of directed graphs and application to structural decomposition
- Laplacian energy of diameter 3 trees
- On the Laplacian-energy-like invariant
- An upper bound for the energy of radial digraphs
- Retracted article: On the Kirchhoff matrix, a new Kirchhoff index and the Kirchhoff energy
- A decreasing sequence of upper bounds for the Laplacian energy of a tree
- On incidence energy of graphs
- A majorization method for localizing graph topological indices
- The energy of \(q\)-Kneser graphs and attenuated \(q\)-Kneser graphs
- Energy of signed digraphs
- On Laplacian energy of graphs
- Energies of some non-regular graphs
- On the average energy of circulant graphs
- Graph energy change due to edge deletion
- Spectra and energies of iterated line graphs of regular graphs
- New lower bounds for Estrada index
- A sharp lower bound of the spectral radius with application to the energy of a graph
- Energy of inverse graphs of dihedral and symmetric groups
- New bounds for the Randić index of graphs
- Some lower bounds for the energy of graphs in terms of spread of matrix
- Distance Laplacian spectral ordering of sun type graphs
- On the sum of the Laplacian eigenvalues of a graph and Brouwer's conjecture
- The maximum matching energy of bicyclic graphs with even girth
- Cayley graphs over a finite chain ring and gcd-graphs
- Generalization of some results concerning eigenvalues of a certain class of matrices and some applications
- Energy of complement of stars
This page was built for publication: The energy of a graph: Old and new results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724749)