Energy of Nonsingular Graphs: Improving Lower Bounds

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 f...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematics (Hidawi) 2021, Vol.2021, p.1-5
Main Authors: Shooshtari, Hajar, Rodriguez, Jonnathan, Jahanbani, Akbar, Shokri, Abbas
Format: Article
Language:English
Subjects:
Eigenvalues
Energy
Graph theory
Graphs
Inequality
Lower bounds
Mathematics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2314-4629
2314-4785
DOI:10.1155/2021/4064508