On the spectral radius of complementary acyclic matrices of zeros and ones
SIAM Journal on Algebraic and Discrete Methods
The Laplacian spectrum of a graph
SIAM Journal on Matrix Analysis and Applications
Hi-index | 0.11 |
Let @?(n,g) be the class of bicyclic graphs on n vertices with girth g. Let @?"1(n,g) be the subclass of @?(n,g) consisting of all bicyclic graphs with two edge-disjoint cycles and @?"2(n,g)=@?(n,g)@?@?"1(n,g). This paper determines the unique graph with the maximal Laplacian spectral radius among all graphs in @?"1(n,g) and @?"2(n,g), respectively. Furthermore, the upper bound of the Laplacian spectral radius and the extremal graph for @?(n,g) are also obtained.