The energy of a graph: Old and new results

From MaRDI portal





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].




Cited in
(only showing first 100 items - show all)








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)