A conjecture on the eigenvalues of threshold graphs

From MaRDI portal




Abstract: Let An be the anti-regular graph of order n. It was conjectured that among all threshold graphs on n vertices, An has the smallest positive eigenvalue and the largest eigenvalue less than 1. Recently, in cite{Cesar2} was given partial results for this conjecture and identified the critical cases where a more refined method is needed. In this paper, we deal with these cases and confirm that conjecture holds.









This page was built for publication: A conjecture on the eigenvalues of threshold graphs

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