On graphs whose energy exceeds the number of vertices

By Ivan Gutman. 2008

61 citations recorded by the source corpus.

Abstract 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 E = ∑ i = 1 n | λ i | . We characterize several classes of graphs for which E  ⩾  n .

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/e64b45c480f301bd9a12f699359b51dfd33559ef