Proof of a problem on Laplacian eigenvalues of trees

DOI10.1016/J.LAA.2016.03.040zbMATH Open1335.15027OpenAlexW2339133900MaRDI QIDQ277141FDOQ277141

Authors: Xiying 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

Recommendations

• Note on the \(k\)th Laplacian eigenvalues of trees with perfect matchings
• On the \(k\)th Laplacian eigenvalues of trees with perfect matchings
• On the second largest Laplacian eigenvalues of trees with nearly perfect matchings
• On the Laplacian spectral radii of trees with perfect matchings
• On the eigenvalue two and matching number of a tree

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)

Cites Work

• Title not available (Why is that?)
• An introduction to the theory of graph spectra
• Bounds on the \(k\)th eigenvalues of trees and forests
• On the Laplacian spectral radius of a tree.
• Note on the \(k\)th Laplacian eigenvalues of trees with perfect matchings
• A relation between the matching number and Laplacian spectrum of a graph
• On the \(k\)th Laplacian eigenvalues of trees with perfect matchings

Cited In (4)

• On the \(s\)th Laplacian eigenvalue of trees of order \(st+1\)
• On trees with Laplacian eigenvalue one
• Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
• Thekth Laplacian eigenvalue of a tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277141)