The spectra of a graph obtained from copies of a generalized Bethe tree (Q861010): Difference between revisions

A generalized Bethe tree is an unweighted rooted tree of \(k\) levels such that in each level the vertices have equal degree. The Laplacian matrix of graph \(G\) is the \(n\times n\) matrix \(L(G)=D(G)-A(G)\) where \(A(G)\) is the adjacency matrix and \(D(G)\) is the diagonal matrix of vertex degrees. For generalized Bethe tree \(\mathcal{B}_k\) of \(k\) levels this paper contains the complete characterization of the eigenvalues of the adjacency matrix and Laplacian matrix of a graph \(\mathcal{B}_K^{(r)}\) obtained from the union of \(r\) copies of \(\mathcal{B}_k\) and the cycle \(\mathcal{C}_r\) conecting the \(r\) vertex roots. Some results concerning the multiplicity of eigenvalues, spectral radii and the algebraic connectivity are also provided.