The minimal spectral radius with given independence number
Abstract
In this paper, we determine the graphs which have the minimal spectral radius among all the connected graphs of order n and the independence number n2-1.
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.