On the \(k\)th Laplacian eigenvalues of trees with perfect matchings

DOI10.1016/j.laa.2009.10.015zbMath1185.05041OpenAlexW1976441431MaRDI QIDQ846334

Wai Chee Shiu, Jian Xi Li, An Chang

Publication date: 9 February 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.10.015

zbMATH Keywords

treeLaplacian eigenvalueboundperfect matchings

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)

Related Items (5)

Proof of a problem on Laplacian eigenvalues of trees ⋮ The multiplicity of Laplacian eigenvalue two in unicyclic graphs ⋮ The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching ⋮ Note on the \(k\)th Laplacian eigenvalues of trees with perfect matchings ⋮ Factoring matrices with a tree-structured sparsity pattern

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on the \(k\)th eigenvalues of trees and forests
• On the Laplacian spectral radius of a tree.
• Thekth Laplacian eigenvalue of a tree
• A relation between the matching number and Laplacian spectrum of a graph

This page was built for publication: On the \(k\)th Laplacian eigenvalues of trees with perfect matchings