A Sharp Forbidden Interval for the Nontrivial Adjacency Eigenvalues of Trivially Perfect Graphs
Abstract
We prove a sharp forbidden interval for the nontrivial adjacency eigenvalues of trivially perfect graphs. More precisely, we show that if G is a trivially perfect graph, then Spec(G) [8-4,0]⊂eq \-1,0\. Moreover, we prove that the interval is best possible at both endpoints: there are connected trivially perfect graphs with eigenvalues arbitrarily close to 8-4 from below, and connected trivially perfect graphs with positive eigenvalues converging to 0.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.