The minimal spectral radius of graphs with a given diameter
โ Scribed by E.R. van Dam; R.E. Kooij
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 228 KB
- Volume
- 423
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. Let B 1 (n, g) be the subclass of B(n, g) consisting of all bicyclic graphs with two edge-disjoint cycles and B 2 (n, g) = B(n, g) \ B 1 (n, g). This paper determines the unique graph with the maximal Laplacian spectral radius a