An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree Original Research Article

A Bethe tree Bd,k is a rooted unweighted of k levels in which the root vertex has degree equal to d, the vertices at level j (2less-than-or-equals, slantjless-than-or-equals, slantk-1) have degree equal to (d+1) and the vertices at level k are the pendant vertices. In this paper, we first derive an explicit formula for the eigenvalues of the adjacency matrix of Bd,k. Moreover, we give the corresponding multiplicities. Next, we derive an explicit formula for the simple nonzero eigenvalues, among them the largest eigenvalue, of the Laplacian matrix of Bd,k. Finally, we obtain upper bounds on the largest eigenvalue of the adjacency matrix and of the Laplacian matrix of any tree image. These upper bounds are given in terms of the largest vertex degree and the radius of image, and they are attained if and only if image is a Bethe tree.