Yi-Zheng Fan ; Jing Xu ; Yi Wang ; Dong Liang - The Laplacian spread of a tree

dmtcs:439 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, Vol. 10 no. 1 - https://doi.org/10.46298/dmtcs.439
The Laplacian spread of a treeArticle

Authors: Yi-Zheng Fan ORCID1,2; Jing Xu 1,2; Yi Wang 1,2; Dong Liang 1

  • 1 Key Laboratory of Intelligent Computing & Signal Processing [China]
  • 2 School of Mathematical Sciences [Anhui]

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.


Volume: Vol. 10 no. 1
Section: Graph and Algorithms
Published on: January 1, 2008
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Consultation statistics

This page has been seen 438 times.
This article's PDF has been downloaded 570 times.