On the Laplacian spectral radii of trees
From MaRDI portal
Publication:1043940
DOI10.1016/j.disc.2008.12.026zbMath1180.05067OpenAlexW2171217979MaRDI QIDQ1043940
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.026
Related Items (10)
The algebraic connectivity of graphs with given circumference ⋮ Laplacian spectral radius and maximum degree of trees with perfect matchings ⋮ Ordering \(Q\)-indices of graphs: given size and circumference ⋮ Ordering trees by \(\alpha\)-index ⋮ On the ordering of the Kirchhoff indices of the complements of trees and unicyclic graphs ⋮ Ordering (signless) Laplacian spectral radii with maximum degrees of graphs ⋮ A note on (signless) Laplacian spectral ordering with maximum degrees of graphs ⋮ On the Laplacian spectral radii of Halin graphs ⋮ Semiregular trees with minimal Laplacian spectral radius ⋮ The Laplacian spectral radius of trees and maximum vertex degree
Cites Work
- Permanent of the Laplacian matrix of trees and bipartite graphs
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- A note on Laplacian graph eigenvalues
- Laplacian matrices of graphs: A survey
- On the Laplacian spectral radius of a tree.
- Ordering trees by their Laplacian spectral radii
- On the second largest Laplacian eigenvalue of trees
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Laplacian spectral radii of trees