Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9133
Title: Bounds for the energy of graphs
Authors: das, kinkar
Gutman, Ivan
Journal: Hacettepe Journal of Mathematics and Statistics
Issue Date: 1-Jan-2016
Abstract: © 2016, Hacettepe University. All rights reserved. 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.
URI: https://scidar.kg.ac.rs/handle/123456789/9133
Type: Article
DOI: 10.15672/HJMS.20164513097
SCOPUS: 84978766830
Appears in Collections:Faculty of Science, Kragujevac
[ Google Scholar ]

Page views(s)

47

Downloads(s)

2

Files in This Item:
File Description SizeFormat 
10.15672-HJMS.20164513097.pdf73.87 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.