Lower bounds for Gaussian Estrada index of graphs
From MaRDI portal
Publication:2333647
DOI10.3390/sym10080325zbMath1423.05103OpenAlexW2887684569MaRDI QIDQ2333647
Publication date: 13 November 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym10080325
Related Items (6)
The many facets of the Estrada indices of graphs and networks ⋮ Gaussianization of the spectra of graphs and networks. Theory and applications ⋮ Extremal problems on exponential vertex-degree-based topological indices ⋮ Lower growth of generalized Hadamard product functions in Clifford setting ⋮ Degree-based indices of some complex networks ⋮ Minimal energy configurations of finite molecular arrays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Estrada index of evolving graphs
- Recent results in the theory of graph spectra
- On line graphs with maximum energy
- Estimating the Estrada index
- Estrada index of random bipartite graphs
- ESTRADA INDEX OF GENERAL WEIGHTED GRAPHS
- Robustness of regular ring lattices based on natural connectivity
- Lower bounds for the Estrada index
- Lower bounds for Estrada Index
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
This page was built for publication: Lower bounds for Gaussian Estrada index of graphs