The skew-rank of oriented graphs

Xueliang Li, Guihai Yu

An oriented graph $G^{\sigma }$ is a digraph without loops and multiple arcs, where $G$ is called the underlying graph of $G^{\sigma }$. Let $S(G^{\sigma })$ denote the skew-adjacency matrix of $G^{\sigma }$. The…