Discrete Mathematics & Theoretical Computer Science, Vol 12, No 3 (2010)

Font Size:  Small  Medium  Large

The Laplacian spread of Cactuses

Ying Liu


Connected graphs in which any two of its cycles have at most one common vertex are called cactues. In this paper, we continue the work on Laplacian spread of graphs, and determined the graph with maximal Laplacian spread in all cactuses with $n$ vertices.

Full Text: PDF PostScript