Two-connected signed graphs with maximum nullity at most two
Sign Up to like & getrecommendations! Published in 2021 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2020.12.002
Abstract: 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,\ldots,n\}$ and $\Sigma\subseteq E$. The edges in $\Sigma$ are called odd and… read more here.
Keywords: signed graphs; sigma; sigma sigma; graphs sigma ... See more keywords