×

Ordering cacti with \(n\) vertices and \(k\) cycles by their Laplacian spectral radii. (English) Zbl 1289.05285

Summary: 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\geq 2k+8\).

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
PDF BibTeX XML Cite
Full Text: DOI