Antisymmetrical Digraphs

Abstract

Summary: We call a digraph “antisymmetrical” if there is an automorphism θ of its graph, of period 2, which reverses the direction of every edge and maps no edge or vertex onto itself. We construct a theory of flows invariant under θ for such a diagraph. This theory is analogous to the Max Flow Min Cut theory for ordinary flows in digraphs. It is found to include that part of the theory of undirected graphs which discusses the existence of spanning subgraphs with a specified valency at each vertex.