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

preprint2020arXivOpen access

Abstract

Let Gσ=(G,σ)G^σ=(G,σ) be a signed graph and A(G,σ)A(G,σ) be its adjacency matrix. Denote by m(G)m(G) the matching number of GG. Let η(G,σ)η(G,σ) be the nullity of (G,σ)(G,σ). 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)≤η(G,σ)≤∣V(G)∣−2m(G)+2c(G),|V(G)|-2m(G)-c(G)\leqη(G,σ)\leq |V(G)|-2m(G)+2c(G), where c(G)c(G) is the dimension of cycle space of GG. 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|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≤s≤3c(G),s≠1)|V(G)|-2m(G)+2c(G)-s,~(0\leq s\leq3c(G), s\neq1) for a given c(G)c(G).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.