On the eigenvalue two and matching number of a tree
From MaRDI portal
(Redirected from Publication:705080)
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.
Cites work
- A relation between the matching number and Laplacian spectrum of a graph
- Bounds on the largest eigenvalues of trees with a given size of matching
- Eigenvalues of the Laplacian of a graph∗
- Laplacian graph eigenvectors
- Laplacian matrices of graphs: A survey
- On bipartite graphs with small number of laplacian eigenvalues greater than two and three
- On graphs with small number of Laplacian eigenvalues greater than two
- On the spectral radius of trees
- Permanental roots and the star degree of a graph
- The Laplacian Spectrum of a Graph
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
- scientific article; zbMATH DE number 5079740 (Why is no real title available?)
- 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)