Abstract
Let \( \mathcal{T}_{2k + 1} \) be the set of trees on 2k+1 vertices with nearly perfect matchings, and let \( \mathcal{S}_{2k + 2} \) be the set of trees on 2k + 2 vertices with perfect matchings. The largest Laplacian spectral radii of trees in \( \mathcal{T}_{2k + 1} \) and \( \mathcal{S}_{2k + 2} \) and the corresponding trees were given by Guo (2003). In this paper, the authors determine the second to the sixth largest Laplacian spectral radii among all trees in \( \mathcal{T}_{2k + 1} \) and give the corresponding trees.
Similar content being viewed by others
References
J. M. Guo, On the Laplacian spectral radius of a tree, Linear Algebra Appl., 2003, 368: 379–385.
D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs-Theory and Applications, VEB Deutscher Verlag d. Wiss./Academic Press, Berlin/New York, 1979.
R. Grone and R. Merris, The Laplacian spectrum of graph II, SIAM J. Discrete Math., 1994, 7(2): 221–229.
J. M. Guo, On the second largest Laplacian eigenvalue of trees, Linear Algebra Appl., 2005, 404: 251–261.
X. Y. Yuan, J. Y. Shao, and C. X. He, On the Laplacian spectral radii of trees with perfect matchings, Journal of Mathematical Chemistry, 2009, 46(1): 65–85.
X. Y. Yuan, B. F. Wu, and E. L. Xiao, The modifications of trees and the Laplacian spectrum, J. East China Norm. Univ. (Natur. Sci.) (in Chinese), 2004, (2): 13–18
J. M. Guo, The effect on the Laplacian spectral radius of a graph by adding or grafting edges, Linear Algebra Appl., 2006, 413(1): 59–71.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the National Natural Science Foundation of China under Grant No. 10331020.
Rights and permissions
About this article
Cite this article
Zhang, L., Shao, J. On the Laplacian spectral radii of trees with nearly perfect matchings. J Syst Sci Complex 22, 533–540 (2009). https://doi.org/10.1007/s11424-009-9184-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-009-9184-4