The Estrada index of chemical trees
✍ Scribed by Aleksandar Ilić; Dragan Stevanović
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 217 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0259-9791
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let G be a simple graph of order n with m edges. Let the adjacency spectrum be {λ 1 , λ 2 , . . . In [J.A. Peña, I. Gutman, J. Rada, Estimating the Estrada index, Linear Algebra Appl. 427 (2007) 70-76], Peña et al. posed a conjecture that the star S n has maximum Estrada index for any tree of order
4, 6)-fullerene a b s t r a c t Suppose G is a graph and λ 1 , λ 2 , . . . λ n are the eigenvalues of G. The Estrada index EE(G) of G is defined as the sum of the terms e λ i , 1 ≤ i ≤ n. In this work some upper and lower bounds for the Estrada index of (4, 6)-fullerene graphs are presented.