Transformation of Signed Graphs into Trees

Abstract

A signed graph $G = (V, E)$ is transformed to a tree by a sequence of local swritching if and only if both parties of \[ And\ \ B^{m} = a_{1}b_{1}, a_{2}b_{2},\dots, a_{m-1}a_{n}a_{1}. \] are odd.