Suppose that 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 , and , respectively. Denoted by 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 and extremal signed graphs corresponding to the lower bound are characterized. Furthermore, the signed graph with for are given. As a by-product, the connected signed graphs with given positive inertia index, nullity and given girth are also determined, respectively.

生成讲解博客的中文版本

生成AI智能校验的中文版本