Improved bounds for the largest eigenvalue of trees
From MaRDI portal
Publication:2484400
Let \({\mathcal T}_{\Delta}\) be the set of all trees with maximum degree \(\Delta\). The reviewer in [Linear Algebra Appl. 360, 35--42 (2003; Zbl 1028.05062)] obtained upper bounds in terms of \(\Delta\) on the largest eigenvalues of the adjacency matrix and the Laplacian matrix of trees in \({\mathcal T}_{\Delta}\). In the paper under review, the author improves these bounds.
Recommendations
Cites work
Cited in
(15)- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- On the largest eigenvalues of trees
- Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
- An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
- New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree
- Upper bounds on the smallest positive eigenvalue of trees
- scientific article; zbMATH DE number 5952367 (Why is no real title available?)
- Bounds for the Laplacian spectral radius of graphs
- scientific article; zbMATH DE number 5199182 (Why is no real title available?)
- scientific article; zbMATH DE number 7070668 (Why is no real title available?)
- Ordering trees by their largest eigenvalues
- The spectra of some trees and bounds for the largest eigenvalue of any tree
- The Laplacian spectral radii of trees with degree sequences
- Laplacian spectral radius of trees with given maximum degree
- The signless Laplacian spectral radius of graphs with given degree sequences
This page was built for publication: Improved bounds for the largest eigenvalue of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484400)