No signed graph with the nullity η(G,σ)=|V(G)| − 2m(G)+2c(G)−1
No signed graph with the nullity η(G,σ)=|V(G)| − 2m(G)+2c(G)−1
复制标题
DOI:
10.1016/j.laa.2021.01.002
复制
发表时间:
2021-04
影响因子:
1.1
通讯作者:
Yong Lu;Jingwen Wu
中科院分区:
文献类型:
--
作者:
Yong Lu;Jingwen Wu
Let G σ=(G, σ) be a signed graph and A (G, σ) be its adjacency matrix. Denote by m (G) the matching number of G. Let η (G, σ) be the nullity of (G, σ). He et al.(2019)[6] proved that| V (G)|− 2 m (G)− c (G)≤ η (G, σ)≤| V (G)|− 2 m (G)+ 2 c (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 there are no signed graphs with nullity| V (G)|− 2 m (G)+ 2 c (G)− 1. We also prove that there are infinitely many signed graphs with nullity| V (G)|− 2 m (G)+ 2 c (G)− s,(0≤ s≤ 3 c (G), s≠ 1) for a given c (G).