The nullity of the net Laplacian matrix of a signed graph
Combinatorics
2023-10-20 v1
Abstract
Let be a signed graph, where is an (unsigned) graph, called the underlying graph. The net Laplacian matrix of is defined as , where and are the diagonal matrix of net-degrees and the adjacency matrix of , respectively. The nullity of , written as , is the multiplicity of 0 as an eigenvalue of . In this paper, we focus our attention on the nullity of the net Laplacian matrix of a connected signed graph and prove that , where is the cyclomatic number of . The connected signed graphs with nullity are completely determined. Moreover, we characterize the signed cactus graphs with nullity or
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