The Laplacian Spectrum of a Graph II
SIAM Journal on Discrete Mathematics
The Laplacian spectral radius of a graph under perturbation
Computers & Mathematics with Applications
New method and new results on the order of spectral radius
Computers & Mathematics with Applications
Hi-index | 0.05 |
A unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo Shu-Guang [S.G. Guo, The largest Laplacian spectral radius of unicyclic graph, Appl. Math. J. Chinese Univ. Ser. A. 16 (2) (2001) 131-135] determined the first four largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices. In this paper, we extend this ordering by determining the fifth to the ninth largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices.