Abstract: We calculate the eigenvalues of the k-regular tree using covers of graphs and combinatorial Laplacians. Our calculations depend heavily on the properties of Chebyshev Polynomials of second type.