Energy of Nonsingular Graphs: Improving Lower Bounds | Zendy

Hajar Shooshtari | Zendy; Jonnathan Rodríguez | Zendy; Akbar Jahanbani | Zendy; Abbas Shokri | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Energy of Nonsingular Graphs: Improving Lower Bounds

Author(s) -

Hajar Shooshtari,

Jonnathan Rodríguez,

Akbar Jahanbani,

Abbas Shokri

Publication year - 2021

Publication title -

journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.252

H-Index - 13

eISSN - 2314-4785

pISSN - 2314-4629

DOI - 10.1155/2021/4064508

Subject(s) - invertible matrix , combinatorics , adjacency matrix , mathematics , graph , pure mathematics

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 = 1 n λ 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research