Remarks on the spectral radius of Kr+1-saturated graphs
Abstract
Write ( G) for the spectral radius of a graph G and Sn,r for the join KrKn-r. Let n>r≥2 and G be a Kr+1-saturated graph of order n. Recently Kim, Kim, Kostochka, and O determined exactly the minimum value of ( G) for r=2, and found an asymptotically tight bound on ( G) for r≥3. They also conjectured that \[ ( G) >( Sn,r-1) , \] unless G=Sn,r-1. In this note their conjecture is proved.
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.