✦ LIBER ✦

Estimating the Estrada index

✍ Scribed by José Antonio de la Peña; Ivan Gutman; Juan Rada

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 129 KB
Volume: 427
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.06.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for Estrada index and Lapla

Lower bounds for Estrada index and Laplacian Estrada index

✍ Hamidreza Bamdad; Firouzeh Ashraf; Ivan Gutman 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Let G be an n-vertex graph. If λ 1 , λ 2 , . . . , λ n and µ 1 , µ 2 , . . . , µ n are the ordinary (adjacency) eigenvalues and the Laplacian eigenvalues of G, respectively, then the Estrada index and the Laplacian Estrada index of G are defined as EE(G) = n i=1 e λ i and LEE(G) = n i=1 e µ i , resp

The Estrada index of trees

✍ Zhibin Du; Bo Zhou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 213 KB

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

✍ Jianbin Zhang; Bo Zhou; Jianping Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Bounds on the Estrada index of ISR -full

Bounds on the Estrada index of ISR -fullerenes

✍ A.R. Ashrafi; G.H. Fath-Tabar 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 225 KB

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.

Estimating the Szeged index

✍ Kinkar Ch. Das; Ivan Gutman 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 370 KB

Lower and upper bounds on Szeged index of connected (molecular) graphs are established as well as Nordhaus-Gaddum-type results, relating the Szeged index of a graph and of its complement.