Energy of nonsingular graphs: improving lower bounds

DOI10.1155/2021/4064508MaRDI QIDQ2052070zbMATH OpenOpenAlexFDO

Authors Hajar Shooshtari, Akbar Jahanbani, Jonnathan Rodríguez, Abbas Ali Shokri

Publication date 25 November 2021

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/4064508

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Review text

Summary: Let \(G\) be a simple graph of order \(n\) and \(A\) be its adjacency matrix. Let \(\lambda_1\geq \lambda_2\geq{\dots}\geq \lambda_n\) be eigenvalues of matrix \(A\). Then, the energy of a graph \(G\) is defined as \(\varepsilon(G)=\sum_{i = 1}^n |\lambda_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.

Recommendations

• Some new lower bounds for energy of graphs
• A new lower bound for the energy of graphs
• Some sharp lower bounds for energy of graphs
• On the energy of singular and non singular graphs
• Some lower bounds for the energy of graphs in terms of spread of matrix

Cites work

• Bounds for eigenvalues of a graph
• Bounds for the energy of graphs
• scientific article; zbMATH DE number 1618184 (Why is no real title available?)
• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 7410313 (Why is no real title available?)
• scientific article; zbMATH DE number 7410314 (Why is no real title available?)
• scientific article; zbMATH DE number 6282176 (Why is no real title available?)
• Lower bounds for the energy of graphs
• New upper bounds for the energy and spectral radius of graph
• On the spectral radius of graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Some lower bounds for the energy of graphs
• Some new lower bounds for energy of graphs
• Some upper bounds for the energy of graphs

Cited in

(7)

• Some relations between rank, chromatic number and energy of graphs
• Some new lower bounds for energy of graphs
• Some lower bounds for the energy of graphs
• A new lower bound for the energy of graphs
• Some lower bounds for the energy of graphs in terms of spread of matrix
• A note on the relationship between graph energy and determinant of adjacency matrix
• On the energy of singular and non singular graphs

This page was built for publication: Energy of nonsingular graphs: improving lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052070)