On the spectra of some weighted rooted trees and applications (Q860992)

The paper studies weighted rooted trees, where the degree of vertices at a certain distance from the root is a function of the distance, and edges at a certain distance from the root have a weight that is a function of the distance as well. The paper gives a complete characterization of the eigenvalues of the Laplacian matrix and the adjacency matrix of such trees: they are the eigenvalues of leading principal submatrices of two non-negative symmetric tridiagonal matrices of order \(k\times k\), where \(k\) counts the levels of the tree according to distances from the root. There are some results also on the multiplicities of eigenvalues. Upper bounds are derived for the largest eigenvalue of any weighted tree and some weighted Bethe trees.