Energy of Nonsingular Graphs: Improving Lower Bounds

Hajar Shooshtari, Jonnathan Rodriguez, Akbar Jahanbani, Abbas Shokri and Hemant Kumar Nashine

Journal of Mathematics, 2021, vol. 2021, 1-5

Abstract: Let G be a simple graph of order n and A be its adjacency matrix. Let λ1≥λ2≥…≥λn be eigenvalues of matrix A. Then, the energy of a graph G is defined as εG=∑i=1nλi. In this paper, we will discuss the new lower bounds for the energy of nonsingular graphs in terms of degree sequence, 2-sequence, the first Zagreb index, and chromatic number. Moreover, we improve some previous well-known bounds for connected nonsingular graphs.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/4064508.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/4064508.xml (application/xml)

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:hin:jjmath:4064508

DOI: 10.1155/2021/4064508

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().