Improved bounds for the largest eigenvalue of trees
From MaRDI portal
Publication:2484400
DOI10.1016/J.LAA.2005.02.023zbMATH Open1069.05046OpenAlexW1965453994MaRDI QIDQ2484400FDOQ2484400
Authors: Oscar Rojo
Publication date: 1 August 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.02.023
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
Cited In (15)
- Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
- Bounds for the Laplacian spectral radius of graphs
- An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- Ordering trees by their largest eigenvalues
- Upper bounds on the smallest positive eigenvalue of trees
- The Laplacian spectral radii of trees with degree sequences
- On the largest eigenvalues of trees
- The signless Laplacian spectral radius of graphs with given degree sequences
- The spectra of some trees and bounds for the largest eigenvalue of any tree
- New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Laplacian spectral radius of trees with given maximum degree
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)