Anti-regular graphs with loops and their spectrum
From MaRDI portal
Publication:6301912
arXiv1805.08287MaRDI QIDQ6301912FDOQ6301912
Authors: Cesar O. Aguilar 
Publication date: 21 May 2018
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)
