Note on the energy of regular graphs

From MaRDI portal




Abstract: For a simple graph G, the energy mathcalE(G) is defined as the sum of the absolute values of all the eigenvalues of its adjacency matrix A(G). Let n,m, respectively, be the number of vertices and edges of G. One well-known inequality is that mathcalE(G)leqlambda1+sqrt(n1)(2mlambda1), where lambda1 is the spectral radius. If G is k-regular, we have mathcalE(G)leqk+sqrtk(n1)(nk). Denote mathcalE0=k+sqrtk(n1)(nk). Balakrishnan [{it Linear Algebra Appl.} {�f 387} (2004) 287--295] proved that for each epsilon>0, there exist infinitely many n for each of which there exists a k-regular graph G of order n with k<n1 and fracmathcalE(G)mathcalE0<epsilon, and proposed an open problem that, given a positive integer ngeq3, and epsilon>0, does there exist a k-regular graph G of order n such that fracmathcalE(G)mathcalE0>1epsilon. In this paper, we show that for each epsilon>0, there exist infinitely many such n that fracmathcalE(G)mathcalE0>1epsilon. Moreover, we construct another class of simpler graphs which also supports the first assertion that fracmathcalE(G)mathcalE0<epsilon.









This page was built for publication: Note on the energy of regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847201)