On the eigenvalue two and matching number of a tree
From MaRDI portal
Publication:705080
DOI10.1007/s10255-004-0166-yzbMath1057.05055MaRDI QIDQ705080
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
05C05: Trees
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
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