A Sharp Forbidden Interval for the Nontrivial Adjacency Eigenvalues of Trivially Perfect Graphs
arXiv:2606.06052
Abstract
We prove a sharp forbidden interval for the nontrivial adjacency eigenvalues of trivially perfect graphs. More precisely, we show that if is a trivially perfect graph, then . Moreover, we prove that the interval is best possible at both endpoints: there are connected trivially perfect graphs with eigenvalues arbitrarily close to from below, and connected trivially perfect graphs with positive eigenvalues converging to .