The spectral radius of bicyclic graphs with prescribed degree sequences
β Scribed by Yingluan Liu; Bolian Liu
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 252 KB
- Volume
- 433
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
Restricted to the bicyclic graphs with prescribed degree sequences, we determine the (unique) graph with the largest spectral radius with respect to the adjacency matrix.
π SIMILAR VOLUMES
Let B(n, g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we determine the unique graph with the maximal spectral radius among all graphs in B(n, g). Moreover, the maximal spectral radius is a decreasing function on g.
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
A connected graph of order n is bicyclic if it has n + 1 edges. He et al. [C.X. He, J.Y. Shao, J.L. He, On the Laplacian spectral radii of bicyclic graphs, Discrete Math. 308 (2008) 5981-5995] determined, among the n-vertex bicyclic graphs, the first four largest Laplacian spectral radii together wi
## Abstract The degree set π^G^ of a graph __G__ is the set of degrees of the vertices of __G.__ For a finite nonempty set __S__ of positive integers, all positive integers __p__ are determined for which there exists a graph __G__ of order __p__ such that π^G^ = __S__.