Lower bounds for Gaussian Estrada index of graphs
Summary: Suppose that \(G\) is a graph over \(n\) vertices. \(G\) has \(n\) eigenvalues (of adjacency matrix) represented by \(\lambda_1\), \(\lambda_2, \dots, \lambda_n\). The Gaussian Estrada index, denoted by \(H(G)\), can be defined as \(H(G) = \sum_{i=1}^n e^{-\lambda_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.
- Estimating the Estrada index
- Estrada index of general weighted graphs
- Estrada index of random bipartite graphs
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- scientific article; zbMATH DE number 1556756 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 6256254 (Why is no real title available?)
- Lower bounds for Estrada Index
- Lower bounds for the Estrada index
- Nullity of graphs: an updated survey
- On Estrada index
- On line graphs with maximum energy
- Recent results in the theory of graph spectra
- Robustness of regular ring lattices based on natural connectivity
- The Estrada index of evolving graphs
- Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation
- Gaussianization of the spectra of graphs and networks. Theory and applications
- Lower growth of generalized Hadamard product functions in Clifford setting
- Degree-based indices of some complex networks
- The many facets of the Estrada indices of graphs and networks
- An increasing sequence of lower bounds for the Estrada index of graphs and matrices
- Minimal energy configurations of finite molecular arrays
- Lower bounds for the Estrada index using mixing time and Laplacian spectrum
- New lower bounds for Estrada index
- Extremal problems on exponential vertex-degree-based topological indices
- 图的广义Randi\'{c} Estrada 指标的界
- scientific article; zbMATH DE number 6154917 (Why is no real title available?)
This page was built for publication: Lower bounds for Gaussian Estrada index of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333647)
