Lower Bounds for Gaussian Estrada Index of Graphs.

Suppose that <italic>G</italic> is a graph over <italic>n</italic> vertices. <italic>G</italic> has <italic>n</italic> eigenvalues (of adjacency matrix) represented by λ 1 , λ 2 , ⋯ , λ n . The Gaussian Estrada index, denoted by H (G) (Estrada et al., Chaos 27(2017) 023109), can be defined as H (G) = ∑ i = 1 n e − λ i 2 . 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 H (G) in terms of the number of vertices, the number of edges, as well as the first Zagreb index. [ABSTRACT FROM AUTHOR]