๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Laplacian eigenvalues of a graph

โœ Scribed by Jiong-Sheng Li; Xiao-Dong Zhang


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
148 KB
Volume
285
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis


In the note, we present an upper bound for the spectral radius of Laplacian matrix of a graph in terms of a "2-degree" of a vertex.


๐Ÿ“œ SIMILAR VOLUMES


A sharp upper bound on the largest Lapla
โœ 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