Doubly regular digraphs and symmetric designs (Q1865408)

Modified abstract: If an incidence matrix \(N\) of a symmetric design is such that \(N + N^t\) is a \((0,1)\) matrix, then \(N\) is an adjacency matrix of a doubly regular asymmetric digraph, and vice versa. The authors show that several well-known families of symmetric designs provide adjacency matrices of doubly regular asymmetric digraphs. They also construct two more infinite families of doubly regular asymmetric digraphs from symmetric designs by using skew balanced generalized weighing matrices.