The spectra of some trees and bounds for the largest eigenvalue of any tree

DOI10.1016/J.LAA.2005.09.018zbMath1092.05047OpenAlexW2042307365MaRDI QIDQ819769

Oscar Rojo

Publication date: 29 March 2006

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.09.018

zbMATH Keywords

spectral radiusadjacency matrixLaplacian matrix

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (11)

An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree ⋮ Dendrimer eigen-characteristics ⋮ The spectra of a graph obtained from copies of a generalized Bethe tree ⋮ On the spectrum of finite, rooted homogeneous trees ⋮ Locating the eigenvalues of trees ⋮ New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree ⋮ On the spectra of some graphs like weighted rooted trees ⋮ On the main spectrum of generalized Bethe trees ⋮ Computing tight upper bounds on the algebraic connectivity of certain graphs ⋮ Computing the Laplacian spectra of some graphs ⋮ Spectra of large random trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian matrices of graphs: A survey
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Improved bounds for the largest eigenvalue of trees
• The spectra of the adjacency matrix and Laplacian matrix for some balanced trees

This page was built for publication: The spectra of some trees and bounds for the largest eigenvalue of any tree