Two-connected signed graphs with maximum nullity at most two

Marina Arav, Frank J. Hall, Zhongshan Li +1

A signed graph is a pair $(G,\Sigma )$, where $G=(V,E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V=\{1,\dots ,n\}$ and $\Sigma \subseteq E$. The edges in $\Sigma$…