On the number of Laplacian eigenvalues of trees smaller than two
From MaRDI portal
(Redirected from Publication:514827)
Recommendations
- A relation between the matching number and Laplacian spectrum of a tree
- On the eigenvalue two and matching number of a tree
- On the second largest Laplacian eigenvalue of trees
- On the number of Laplacian eigenvalues of trees less than the average degree
- On the second largest Laplacian eigenvalues of trees with nearly perfect matchings
Cites work
Cited in
(24)- Laplacian distribution and domination
- A note on the integer eigenvalues of the Laplacian matrix of a balanced binary tree
- Domination number and Laplacian eigenvalue of trees
- Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
- On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings
- Most Laplacian eigenvalues of a tree are small
- Trees with 4 or 5 distinct normalized Laplacian eigenvalues
- A relation between the matching number and Laplacian spectrum of a tree
- Domination and spectral graph theory
- On trees with Laplacian eigenvalue one
- On the distribution of Laplacian eigenvalues of trees
- The second least eigenvalue of the signless Laplacian of the complements of trees
- The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\)
- On a conjecture of Laplacian energy of trees
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
- Classification of trees by Laplacian eigenvalue distribution and edge covering number
- Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond
- Laplacian eigenvalue distribution and diameter of graphs
- On Radenković and Gutman conjecture for some classes of trees of diameter 5
- Diameter vs. Laplacian eigenvalue distribution
- Laplacian eigenvalue distribution, diameter and domination number of trees
- On the number of Laplacian eigenvalues of trees less than the average degree
- Minimizing the Laplacian eigenvalues for trees with given domination number
- Domination number and Laplacian eigenvalue distribution
This page was built for publication: On the number of Laplacian eigenvalues of trees smaller than two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514827)