Abstract

We generalize the concept of a Bethe tree as follows: we say that an unweighted rooted tree is a generalized Bethe tree if in each level the vertices have equal degree. If Bk is a generalized Bethe tree of k levels then we characterize completely the eigenvalues of the adjacency matrix and Laplacian matrix of a graph Bk (r) obtained from the union of r copies of Bk and the cycle Cr connecting the r vertex roots. Moreover, we give results on the multiplicity of the eigenvalues, on the spectral radii and on the algebraic conectivity. © 2006 Elsevier Inc. All rights reserved.