Some new lower bounds for energy of graphs

Akbar Jahanbani

Applied Mathematics and Computation, 2017, vol. 296, issue C, 233-238

Abstract: The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. In this paper we present some new lower bounds for energy of non-singular graphs, connected non-singular graphs and connected unicyclic non-singular graphs in terms of number of vertices, number of edges, maximum degree and Zagreb indices.

Keywords: Eigenvalue; Energy; Non-singular graphs; Adjacency matrix (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316306178
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:296:y:2017:i:c:p:233-238

DOI: 10.1016/j.amc.2016.10.019

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().