A conjecture on the eigenvalues of threshold graphs

From MaRDI portal
Publication:2228534

DOI10.1016/J.LAA.2020.11.007zbMATH Open1472.05100arXiv2006.03136OpenAlexW3105020611WikidataQ113869478 ScholiaQ113869478MaRDI QIDQ2228534FDOQ2228534

Fernando Colman Tura

Publication date: 17 February 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2006.03136




Recommendations




Cites Work


Cited In (6)





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)