Some Criteria for a Signed Graph to Have Full Rank

S. Akbari, A. Ghafari, K. Kazemian +1

A weighted graph $G^{\omega }$ consists of a simple graph $G$ with a weight $\omega$, which is a mapping,$\omega$: $E(G)\to \mathbb{Z}\backslash \{0\}$. A signed graph is a graph whose edges a…