TY - JOUR
T1 - Bounds for the energy of graphs
AU - Das, Kinkar Ch
AU - Gutman, Ivan
N1 - Publisher Copyright:
© 2016, Hacettepe University. All rights reserved.
PY - 2016
Y1 - 2016
N2 - The energy of a graph G, denoted by E(G), is the sum of the absolute values of all eigenvalues of G. In this paper we present some lower and upper bounds for E(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 E(G) are established.
AB - The energy of a graph G, denoted by E(G), is the sum of the absolute values of all eigenvalues of G. In this paper we present some lower and upper bounds for E(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 E(G) are established.
KW - Determinant of adjacency matrix
KW - Energy (of graph)
KW - Graph spectrum
UR - https://www.scopus.com/pages/publications/84978766830
U2 - 10.15672/HJMS.20164513097
DO - 10.15672/HJMS.20164513097
M3 - Article
AN - SCOPUS:84978766830
SN - 2651-477X
VL - 45
SP - 695
EP - 703
JO - Hacettepe Journal of Mathematics and Statistics
JF - Hacettepe Journal of Mathematics and Statistics
IS - 3
ER -