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. © 2008 Discrete Mathematics and Theoretical Computer Science (DMTCS).
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Fan, Y. Z., Xu, J., Wang, Y., & Liang, D. (2008). The Laplacian Spread of a Tree. Discrete Mathematics and Theoretical Computer Science, 10(1), 79–86. https://doi.org/10.46298/dmtcs.439
Readers over time
Readers' Seniority
Readers' Discipline
