Anti-regular graphs with loops and their spectrum
arXiv:1805.08287
Abstract
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The spectrum is found by using the known relationship between tridiagonal matrices and orthogonal polynomials.
8 pages