On graphs whose energy exceeds the number of vertices Original Research Article

Let G be a graph on n vertices, and let λ1,λ2,…,λn be the eigenvalues of a (0,1)-adjacency matrix of G. The energy of G is image. We characterize several classes of graphs for which E greater-or-equal, slanted n.