Laplacian spectral radius of trees with given maximum degree
From MaRDI portal
Publication:947660
DOI10.1016/j.laa.2008.05.028zbMath1144.05324MaRDI QIDQ947660
Publication date: 6 October 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.05.028
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
Related Items
The Laplacian spectral radius of bicyclic graphs with a given girth, The Laplacian spectral radius of some graphs
Cites Work
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- On the Laplacian spectral radius of trees with fixed diameter
- Laplacian matrices of graphs: A survey
- On the Laplacian spectral radius of a tree.
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- Improved bounds for the largest eigenvalue of trees
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item