arXiv Analytics

Sign in

arXiv:2006.00002 [math.CO]AbstractReferencesReviewsResources

No signed graph with the nullity $η(G,σ)=|V(G)|-2m(G)+2c(G)-1$

Yong Lu, Jingwen Wu

Published 2020-05-29Version 1

Let $G^{\sigma}=(G,\sigma)$ be a signed graph and $A(G,\sigma)$ be its adjacency matrix. Denote by $m(G)$ the matching number of $G$. Let $\eta(G,\sigma)$ be the nullity of $(G,\sigma)$. He et al. [Bounds for the matching number and cyclomatic number of a signed graph in terms of rank, Linear Algebra Appl. 572 (2019), 273--291] proved that $$|V(G)|-2m(G)-c(G)\leq\eta(G,\sigma)\leq |V(G)|-2m(G)+2c(G),$$ where $c(G)$ is the dimension of cycle space of $G$. Signed graphs reaching the lower bound or the upper bound are respectively characterized by the same paper. In this paper, we will prove that no signed graphs with nullity $|V(G)|-2m(G)+2c(G)-1$. We also prove that there are infinite signed graphs with nullity $|V(G)|-2m(G)+2c(G)-s,~(0\leq s\leq3c(G), s\neq1)$ for a given $c(G)$.

Comments: 15pages, 2 figures
Categories: math.CO
Subjects: 05C35, 05C50
Related articles: Most relevant | Search more
arXiv:1301.0374 [math.CO] (Published 2013-01-03, updated 2013-01-05)
The triangle-free graphs with rank 6
arXiv:math/0201211 [math.CO] (Published 2002-01-22)
The kernel of the adjacency matrix of a rectangular mesh
arXiv:0903.5353 [math.CO] (Published 2009-03-31)
Spectral radius and Hamiltonicity of graphs