Proof of a problem on Laplacian eigenvalues of trees

DOI10.1016/J.LAA.2016.03.040zbMath1335.15027OpenAlexW2339133900MaRDI QIDQ277141

Xi-Ying Yuan

Publication date: 4 May 2016

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

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

zbMATH Keywords

treeperfect matching\(k\)-th Laplacian eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (1)

Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs

Cites Work

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

This page was built for publication: Proof of a problem on Laplacian eigenvalues of trees