Lower Bounds for the Energy of (Bipartite) Graphs

The energy of a graph is defined as the sum of absolute values of its eigenvalues. In this paper, we establish some lower bounds for the energy of (bipartite) graphs involving the number of vertices (n), the number edges (m) and the determinant of the adjacency matrix (det A). Our lower bound for graphs improves the lower bound in [2] for a class of graphs.