Abstract
Let G be a graph of order n and let λ 1, λ 2, …, λ n be its eigenvalues. The Estrada index [2] of G is defined as EE = EE(G) = \( \sum\limits_{i = 1}^n {e^{\lambda _i } } \). In this paper, new bounds for EE are established, as well as some relations between EE and graph energy E.
Similar content being viewed by others
References
D Cvetković, M Doob, H Sachs. Spectra of Graphs — Theory and Application, Academic Press, 1980.
E Estrada. Characterization of 3D molecular structure, Chem Phys Lett, 2000, 319: 713–718.
E Estrada. Characterization of the folding degree of proteins, Bioinformatics, 2002, 18: 697–704.
E Estrada. Characterization of the amino acid contribution to the folding degree of proteins, Proteins, 2004, 54: 727–737.
E Estrada, J A Rodríguez-Velázquez. Subgraph centrality in complex networks, Phys Rev E, 2005, 71: 056103-1–056103-9.
E Estrada, J A Rodríguez-Velázquez. Spectral measures of bipartivity in complex networks, Phys Rev E, 2005, 72: 046105-1–046105-6.
E Estrada, J A Rodríguez-Velázquez, M Randić. Atomic branching in molecules, Int J Quantum Chem, 2006, 106: 823–832.
I Gutman. The energy of a graph, Ber Math-Statist Sekt Forschungszentrum Graz, 1978, 103: 1–22.
J A de la Peña, I Gutman, J Rada. Estimating the Estrada index, Linear Algebra Appl, 2007, 427: 70–76.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (10771080), by the Fund of Fuzhou University (XRC-0956), and by the Natural Science Foundation of Fujian Province (2010J05005).
Rights and permissions
About this article
Cite this article
Liu, Jp., Liu, Bl. Bounds of the Estrada index of graphs. Appl. Math. J. Chin. Univ. 25, 325–330 (2010). https://doi.org/10.1007/s11766-010-2237-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11766-010-2237-6