Every simple graph can be represented by an adjacency matrix. The minimum skew rank of a graph is the smallest possible rank of all skew-symmetric matrices whose non-zero entries correspond to edges of the graph. Extensive ...