Characterizing the positive inertia index of connected signed graphs in terms of girth
Abstract
Let Gσ=(G,σ) be a connected signed graph and A(Gσ) be its adjacency matrix. The positive inertia index of Gσ, denoted by p+(Gσ), is defined as the number of positive eigenvalues of A(Gσ). Assume that Gσ contains at least one cycle, and let gr be its girth. In this paper, we prove p+(Gσ) ≥ gr2 -1 for a signed graph Gσ. The extremal signed graphs corresponding to p+(Gσ) = gr2 -1 and p+(Gσ) = gr2 are characterized, respectively. The results presented in this article extend the recent work on ordinary graphs by Duan and Yang (Linear Algebra Appl., 2024) to the context of signed graphs.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.