On the eigenvalue two and matching number of a tree
DOI10.1007/S10255-004-0166-YzbMATH Open1057.05055OpenAlexW1979760486MaRDI QIDQ705080FDOQ705080
Authors: Yizheng Fan 
Publication date: 25 January 2005
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-004-0166-y
Recommendations
- A relation between the matching number and Laplacian spectrum of a tree
- Note 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 second largest Laplacian eigenvalue of trees
- A note on the second largest eigenvalue of a tree with perfect matchings.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Eigenvalues of the Laplacian of a graph∗
- Laplacian matrices of graphs: A survey
- The Laplacian Spectrum of a Graph
- Laplacian graph eigenvectors
- A relation between the matching number and Laplacian spectrum of a graph
- Permanental roots and the star degree of a graph
- Bounds on the largest eigenvalues of trees with a given size of matching
- On the spectral radius of trees
- On graphs with small number of Laplacian eigenvalues greater than two
- On bipartite graphs with small number of laplacian eigenvalues greater than two and three
Cited In (9)
- The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching
- Proof of a problem on Laplacian eigenvalues of trees
- On trees with perfect matchings
- The multiplicity of Laplacian eigenvalue two in unicyclic graphs
- A relation between the matching number and Laplacian spectrum of a tree
- Title not available (Why is that?)
- A relation between multiplicity of nonzero eigenvalues of trees and their matching numbers
- On the number of Laplacian eigenvalues of trees smaller than two
- On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings
This page was built for publication: On the eigenvalue two and matching number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705080)
