Maximizing the Laplacian spectral radii of graphs with given diameter
โ Scribed by Mingqing Zhai; Jinlong Shu; Zhonghua Lu
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 166 KB
- Volume
- 430
- 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 GB(n, d) be the set of bipartite graphs with order n and diam- eter d. This paper characterizes the extremal graph with the maximal spectral radius in GB(n, d). Furthermore, the maximal spectral radius is a decreasing function on d. At last, bipartite graphs with the second largest spectral radi