Index perturbation of signed graphs
Abstract
Let Γ= (G, σ) be a signed graph and v a non-isolated vertex of Γ. Let Γ-v denote the graph obtained by deleting the vertex v together with all signed edges incident to it from Γ, and dΓ(v) the degree of v in Γ. In this paper, we prove that the largest eigenvalue λ1(Γ) of Γ satisfies \[ λ1(Γ) λ12(Γ- v) + 2dΓ(v) - 1, \] and we also present a refined version of this bound. Moreover, we characterize the extremal signed graphs achieving equality when Γ is connected and dΓ(v) 2, which are switching equivalent to the balanced complete signed graph.
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.