𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved upper bound for Laplacian graph eigenvalues

✍ Scribed by Kinkar ch. Das

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
104 KB
Volume
368
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new upper bound for eigenvalues of the
A new upper bound for eigenvalues of the laplacian matrix of a graph
✍ Li Jiong-Sheng; Zhang Xiao-Dong πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 270 KB

We first give a result on eigenvalues of the line graph of a graph. We then use the result to present a new upper bound for eigenvalues of the Laplacian matrix of a graph. Moreover we determine all graphs the largest eigenvalue of whose Laplacian matrix reaches the upper bound.

Two sharp upper bounds for the Laplacian
Two sharp upper bounds for the Laplacian eigenvalues
✍ Xiao-Dong Zhang πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 168 KB

In this paper, we first obtain a sharp upper bound for the eigenvalues of the adjacency matrix of the line graph of a graph. Then this result is used to present a sharp upper bound for the Laplacian eigenvalues. Another sharp upper bound is presented also. Moreover, we determine all extreme graphs w

A sharp upper bound on the largest Lapla
A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
✍ Kinkar Ch. Das; R.B. Bapat πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 217 KB

We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of the graph is defined in the usual way. We obtain an upper bound on the largest eigenvalue of the Laplacian and characterize graphs for which the bound is attained. The classical bound of Anderson and