On the Laplacian spectral radii of trees with nearly perfect matchings

DOI10.1007/S11424-009-9184-4zbMath1185.05102OpenAlexW2040656251MaRDI QIDQ968002

Li Zhang, Jia-yu Shao

Publication date: 3 May 2010

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-009-9184-4

zbMATH Keywords

treeLaplacian eigenvalueperfect matchingnearly perfect matching

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• On the Laplacian spectral radii of trees with perfect matchings
• On the Laplacian spectral radius of a tree.
• On the second largest Laplacian eigenvalue of trees
• The Laplacian Spectrum of a Graph II

This page was built for publication: On the Laplacian spectral radii of trees with nearly perfect matchings