Lower Bounds for Gaussian Estrada Index of Graphs
School of Mathematical Sciences, Tongji University, Shanghai 200092, China
Received: 3 July 2018 / Revised: 3 August 2018 / Accepted: 6 August 2018 / Published: 7 August 2018
Suppose that G
is a graph over n
eigenvalues (of adjacency matrix) represented by
. The Gaussian Estrada index, denoted by
(Estrada et al., Chaos 27(2017) 023109), can be defined as
. Gaussian Estrada index underlines the eigenvalues close to zero, which plays an important role in chemistry reactions, such as molecular stability and molecular magnetic properties. In a network of particles governed by quantum mechanics, this graph-theoretic index is known to account for the information encoded in the eigenvalues of the Hamiltonian near zero by folding the graph spectrum. In this paper, we establish some new lower bounds for
in terms of the number of vertices, the number of edges, as well as the first Zagreb index.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Shang, Y. Lower Bounds for Gaussian Estrada Index of Graphs. Symmetry 2018, 10, 325.
Shang Y. Lower Bounds for Gaussian Estrada Index of Graphs. Symmetry. 2018; 10(8):325.
Shang, Yilun. 2018. "Lower Bounds for Gaussian Estrada Index of Graphs." Symmetry 10, no. 8: 325.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.