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

Saieed Akbari, Hossein Dabirian, S. Mahmood Ghasemi

Let $G$ be a graph of order $n$ with adjacency matrix $A(G)$. The \textit{energy} of graph $G$, denoted by $\mathcal{E}(G)$, is defined as the sum of absolute value of eigenvalues…