A structure theory for signed graphs with fixed smallest eigenvalue
Abstract
In this paper, we will give a structure theory for signed graphs with fixed smallest eigenvalue and investigate signed graphs with smallest eigenvalue greater than -1-2. Given a real number λ≤ -1, we show that the following hold for each signed graph (G,σ) with smallest eigenvalue at least λ and large minimum valency: (i) there exist dense induced subgraphs N1, …, Nr in (G,σ) such that each vertex lies in at most -λ Ni's and almost all edges of (G,σ) lie in at least one of the Ni's; (ii) if λ>-1-2, then (G,σ) has smallest eigenvalue at least -2 and (G,σ) is 1-integrable.
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.