Bounds for the energy of graphs

Authors : Kinkar Ch DAS, İvan GUTMAN
Pages : 695-703
View : 26 | Download : 10
Publication Date : 2016-06-01
Article Type : Research Paper
Abstract :The energy of a graph G, denoted by Einsert ignore into journalissuearticles values(G);, is the sum of the absolute values of all eigenvalues of G. In this paper we present some lower and upper bounds for Einsert ignore into journalissuearticles values(G); in terms of number of vertices, number of edges, and determinant of the adjacency matrix. Our lower bound is better than the classical McClelland’s lower bound. In addition, Nordhaus–Gaddum type results for Einsert ignore into journalissuearticles values(G); are established.
Keywords : Graph spectrum, energy of graph, determinant of adjacency matrix

ORIGINAL ARTICLE URL
VIEW PAPER (PDF)