On the eigenvalue two and matching number of a tree

DOI10.1007/S10255-004-0166-YzbMath1057.05055OpenAlexW1979760486MaRDI QIDQ705080

Yi-Zheng 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

zbMATH Keywords

eigenvaluesmatchingLaplaciantrees

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 (2)

The multiplicity of Laplacian eigenvalue two in unicyclic graphs ⋮ The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching

Cites Work

• Permanental roots and the star degree of a graph
• Laplacian graph eigenvectors
• Laplacian matrices of graphs: A survey
• Bounds on the largest eigenvalues of trees with a given size of matching
• On graphs with small number of Laplacian eigenvalues greater than two
• The Laplacian Spectrum of a Graph
• Eigenvalues of the Laplacian of a graph^∗
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• A relation between the matching number and Laplacian spectrum of a graph
• On the spectral radius of trees

This page was built for publication: On the eigenvalue two and matching number of a tree