English

The nullity of the net Laplacian matrix of a signed graph

Combinatorics 2023-10-20 v1

Abstract

Let Γ=(G,σ)\Gamma = (G, \sigma) be a signed graph, where G=(V(G),E(G))G = (V(G),E(G)) is an (unsigned) graph, called the underlying graph. The net Laplacian matrix of Γ\Gamma is defined as L±(Γ)=D±(Γ)A(Γ)L^{\pm}(\Gamma) = D^{\pm}(\Gamma) - A(\Gamma), where D±(Γ)D^{\pm}(\Gamma) and A(Γ)A(\Gamma) are the diagonal matrix of net-degrees and the adjacency matrix of Γ\Gamma, respectively. The nullity of L±(Γ)L^{\pm}(\Gamma), written as η(L±(Γ)) \eta (L^{\pm} (\Gamma)), is the multiplicity of 0 as an eigenvalue of L±(Γ)L^{\pm}(\Gamma). In this paper, we focus our attention on the nullity of the net Laplacian matrix of a connected signed graph Γ\Gamma and prove that 1η(L±(Γ))min{β(Γ)+1,V(Γ)1}1 \leq \eta (L^{\pm} (\Gamma)) \leq min\{ \beta(\Gamma) + 1, |V(\Gamma)| - 1 \}, where β(Γ)=E(Γ)V(Γ)+1\beta(\Gamma) = |E(\Gamma)| - |V(\Gamma)| + 1 is the cyclomatic number of Γ\Gamma. The connected signed graphs with nullity V(Γ)1|V(\Gamma)| - 1 are completely determined. Moreover, we characterize the signed cactus graphs with nullity 11 or β(Γ)+1\beta(\Gamma) + 1

Keywords

Cite

@article{arxiv.2310.12784,
  title  = {The nullity of the net Laplacian matrix of a signed graph},
  author = {Zhuang Xiong},
  journal= {arXiv preprint arXiv:2310.12784},
  year   = {2023}
}

Comments

11 pages, 1 figures