A lower bound of the energy of non-singular graphs in terms of average degree

arXiv2207.04599MaRDI QIDQ6404552FDOQ6404552

Authors: S. Akbari, Hossein Dabirian, S. Mahmood Ghasemi 

Publication date: 10 July 2022

Abstract: Let $G$ be a graph of order $n$ with adjacency matrix $A(G)$. The extit{energy} of graph $G$, denoted by $mathcalE(G)$, is defined as the sum of absolute value of eigenvalues of $A(G)$. It was conjectured that if $A(G)$ is non-singular, then $mathcalE(G)geqDelta(G)+delta(G)$. In this paper we propose a stronger conjecture as for $ngeq5$, $mathcalE(G)geqn-1+d$, where $d$ is the average degree of $G$. Here, we show that conjecture holds for bipartite graphs, planar graphs and for the graphs with $dleqn-2lnn-3$

This page was built for publication: A lower bound of the energy of non-singular graphs in terms of average degree

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