Anti-regular graphs with loops and their spectrum

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.

This page was built for publication: Anti-regular graphs with loops and their spectrum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301912)