On singular signed graphs with nullspace spanned by a full vector: Signed nut graphs

Nino Bašić, Patrick W. Fowler, Tomaž Pisanski +1

A signed graph has edge weights drawn from the set $\{+1,-1\}$, and is termed sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwis…