Ordering cacti with n vertices and k cycles by their Laplacian spectral radii
Ordering cacti with n vertices and k cycles by their Laplacian spectral radii
A graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we determine the first sixteen largest Laplacian spectral radii together with the corresponding graphs among all connected cacti with n vertices and k cycles, where n > 2k + 8.