Doubly regular digraphs and symmetric designs

DOI10.1016/S0097-3165(02)00015-8MaRDI QIDQ1865408zbMATH OpenFDO

Publication date 26 March 2003

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0097-3165(02)00015-8

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Directed graphs (digraphs), tournaments (05C20)

Review text

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.

Recommendations

Cites work

Cited in

(15)

This page was built for publication: Doubly regular digraphs and symmetric designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865408)