The nullity of the net Laplacian matrix of a signed graph
Abstract
Let = (G, σ) be a signed graph, where G = (V(G),E(G)) is an (unsigned) graph, called the underlying graph. The net Laplacian matrix of is defined as L() = D() - A(), where D() and A() are the diagonal matrix of net-degrees and the adjacency matrix of , respectively. The nullity of L(), written as η (L ()), is the multiplicity of 0 as an eigenvalue of L(). In this paper, we focus our attention on the nullity of the net Laplacian matrix of a connected signed graph and prove that 1 ≤ η (L ()) ≤ min\ β() + 1, |V()| - 1 \, where β() = |E()| - |V()| + 1 is the cyclomatic number of . The connected signed graphs with nullity |V()| - 1 are completely determined. Moreover, we characterize the signed cactus graphs with nullity 1 or β() + 1
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.