Anti-regular graphs with loops and their spectrum
Combinatorics
2019-12-16 v2
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.
Cite
@article{arxiv.1805.08287,
title = {Anti-regular graphs with loops and their spectrum},
author = {Cesar O. Aguilar},
journal= {arXiv preprint arXiv:1805.08287},
year = {2019}
}
Comments
8 pages