𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on the Estrada index of ISR -fullerenes

✍ Scribed by A.R. Ashrafi; G.H. Fath-Tabar

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
225 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

On the Estrada index conjecture
On the Estrada index conjecture
✍ Kinkar Ch. Das; Sang-Gu Lee πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 150 KB

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

On Estrada index of trees
On Estrada index of trees
✍ Jianbin Zhang; Bo Zhou; Jianping Li πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 230 KB
The Estrada index of trees
The Estrada index of trees
✍ Zhibin Du; Bo Zhou πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 213 KB
On bounds for the index of double nested
On bounds for the index of double nested graphs
✍ M. AndeliΔ‡; C.M. da Fonseca; S.K. SimiΔ‡; D.V. ToΕ‘iΔ‡ πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 262 KB