The Laplacian spread of Cactuses - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

The Laplacian spread of Cactuses

Ying Liu
College of Mathematics and Information [Shangai]

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.

Domains

Discrete Mathematics [cs.DM]
Fichier principal
Vignette du fichier
1301-5061-2-PB.pdf (212.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Service Ist Inria Sophia Antipolis-Méditerranée / I3s  : Connect in order to contact the contributor

https://inria.hal.science/hal-00990441

Submitted on : Tuesday, May 13, 2014-3:37:11 PM

Last modification on : Tuesday, February 7, 2023-3:42:46 AM

Long-term archiving on: Monday, April 10, 2017-10:18:28 PM

Download

Dates and versions

hal-00990441 , version 1 (13-05-2014)

Identifiers

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

TDS-MACS
64 View
962 Download

Altmetric

Share

Gmail Facebook X LinkedIn More