𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Estrada and Laplacian Estrada indices of graphs

✍ Scribed by Zhibin Du; Zhongzhu Liu

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
344 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

On the Laplacian spread of graphs
On the Laplacian spread of graphs
✍ Mingqing Zhai; Jinlong Shu; Yuan Hong πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 238 KB

The Laplacian spread s(G) of a graph G is defined to be the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of G. Several upper bounds of Laplacian spread and corresponding extremal graphs are obtained in this paper. Particularly, if G is a conne

On the Laplacian coefficients of acyclic
On the Laplacian coefficients of acyclic graphs
✍ Bojan Mohar πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 121 KB

Let G be a graph of order n and let (G, Ξ») = n k=0 (-1) k c k Ξ» n-k be the characteristic polynomial of its Laplacian matrix. Zhou and Gutman recently proved that among all trees of order n, the kth coefficient c k is largest when the tree is a path, and is smallest for stars. A new proof and a stre