Article ID Journal Published Year Pages File Type
4603918 Linear Algebra and its Applications 2006 26 Pages PDF
Abstract

Let T be an unweighted tree with vertex root v which is the union of two trees T1=(V1,E1), T2=(V2,E2) such that V1 ∩ V2 = {v} and T1 and T2 have the property that the vertices in each of their levels have equal degree. We characterize completely the eigenvalues of the adjacency matrix and of the Laplacian matrix of T. They are the eigenvalues of symmetric tridiagonal matrices whose entries are given in terms of the vertex degrees. Moreover, we give some results about the multiplicity of the eigenvalues. Applications to some particular trees are developed.

Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory