Skip to Main content Skip to Navigation
Journal articles

The Laplacian spread of a tree

Abstract : The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we show that the star is the unique tree with maximal Laplacian spread among all trees of given order, and the path is the unique one with minimal Laplacian spread among all trees of given order.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:07:41 PM
Last modification on : Tuesday, December 1, 2020 - 3:34:02 PM
Long-term archiving on: : Thursday, July 3, 2014 - 4:30:23 PM


Files produced by the author(s)


  • HAL Id : hal-00972305, version 1



Yi-Zheng Fan, Jing Xu, Yi Wang, Dong Liang. The Laplacian spread of a tree. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (1), pp.79--86. ⟨hal-00972305⟩



Record views


Files downloads