Energy of nonsingular graphs: improving lower bounds (Q2052070): Difference between revisions

Summary: Let \(G\) be a simple graph of order \(n\) and \(A\) be its adjacency matrix. Let \(\lambda_1\geq \lambda_2\geq{\dots}\geq \lambda_n\) be eigenvalues of matrix \(A\). Then, the energy of a graph \(G\) is defined as \(\varepsilon(G)=\sum_{i = 1}^n |\lambda_i|\). In this paper, we will discuss the new lower bounds for the energy of nonsingular graphs in terms of degree sequence, 2-sequence, the first Zagreb index, and chromatic number. Moreover, we improve some previous well-known bounds for connected nonsingular graphs.