Skip to Main content Skip to Navigation
Journal articles

The Laplacian spread of Cactuses

Abstract : Connected graphs in which any two of its cycles have at most one common vertex are called cactuses. In this paper, we continue the work on Laplacian spread of graphs, and determine the graph with maximal Laplacian spread in all cactuses with n vertices.
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990441
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:37:11 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:18 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:18:28 PM

File

1301-5061-2-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990441, version 1

Collections

Citation

Ying Liu. The Laplacian spread of Cactuses. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (3), pp.35-40. ⟨hal-00990441⟩

Share

Metrics

Record views

155

Files downloads

1006