Connected signed graphs with given inertia indices and given girth
Abstract
Suppose that =(G, σ) is a connected signed graph with at least one cycle. The number of positive, negative and zero eigenvalues of the adjacency matrix of are called positive inertia index, negative inertia index and nullity of , which are denoted by i+(), i-() and η(), respectively. Denoted by g the girth, which is the length of the shortest cycle of . We study relationships between the girth and the negative inertia index of in this article. We prove i-()≥ g2-1 and extremal signed graphs corresponding to the lower bound are characterized. Furthermore, the signed graph with i-()=g2 for g≥ 4 are given. As a by-product, the connected signed graphs with given positive inertia index, nullity and given girth are also determined, respectively.
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.