On the Laplacian spectral radius of cactuses with n vertices

Abstract

A graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we determine the first four largest Laplacian spectral radii together with the corresponding graphs among all connected cactuses with n vertices.