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
โฆ 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
A new upper bound for the Laplacian spec
โ
Ji-Ming Guo
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 172 KB
The Laplacian spectral radius of some gr
โ
Jianxi Li; Wai Chee Shiu; Wai Hong Chan
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 178 KB
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
The Laplacian spectral radius of some bi
โ
Xiaoling Zhang; Heping Zhang
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 170 KB
Sharp upper bounds on the spectral radiu
โ
Jinlong Shu; Yarong Wu
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 176 KB