On limit points of Laplacian spectral radii of graphs
โ Scribed by Ji-Ming Guo
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 161 KB
- Volume
- 429
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let G be a simple graph with vertices v 1 , v 2 , . . . , v n , of degrees = ) is called the signless Laplacian spectral radius or Q -spectral radius of G. Denote by ฯ(G) the chromatic number for a graph G. In this paper, for graphs with order n, the extremal graphs with both the given chromatic num
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