LOWER BOUNDS FOR ESTRADA INDEX

If G is an (n, m)-graph whose spectrum consists of the numbers λ1 ,λ 2 ,...,λ n, then its Estrada index is EE(G )= n=1 e λi. We establish lower bounds for EE(G )i n terms ofn and m.

[1]  D. Cvetkovic,et al.  Spectra of graphs : theory and application , 1995 .

[2]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Ernesto Estrada,et al.  Characterization of the folding degree of proteins , 2002, Bioinform..

[4]  Michael Doob,et al.  Spectra of graphs , 1980 .

[5]  J. A. Rodríguez-Velázquez,et al.  Atomic branching in molecules , 2006 .

[6]  J. A. Rodríguez-Velázquez,et al.  Spectral measures of bipartivity in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  J. A. Peña,et al.  Estimating the Estrada index , 2007 .

[8]  Ernesto Estrada.  Characterization of 3D molecular structure , 2000 .