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

Bounds on the (Laplacian) spectral radius of graphs

โœ Scribed by Lingsheng Shi


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
181 KB
Volume
422
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The Laplacian spectral radius of graphs
โœ Liang Lin ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 89 KB

Let G be an n-vertex (n 3) simple graph embeddable on a surface of Euler genus ฮณ (the number of crosscaps plus twice the number of handles). Denote by the maximum degree of G. In this paper, we first present two upper bounds on the Laplacian spectral radius of G as follows: (i) (ii) If G is 4-conn

Extremal graph characterization from the
โœ Kinkar Ch. Das ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB

We consider weighted graphs, where the edge weights are positive definite matrices. In this paper, we obtain two upper bounds on the spectral radius of the Laplacian matrix of weighted graphs and characterize graphs for which the bounds are attained. Moreover, we show that some known upper bounds on