Doubly regular digraphs and symmetric designs
type: Item
instance of: scholarly article
title: Doubly regular digraphs and symmetric designs
zbMATH Open document ID: 1016.05007
DOI: 10.1016/S0097-3165(02)00015-8
author: H. Kharaghani
author: Yury J. Ionin
published in: Journal of Combinatorial Theory. Series A
publication date: 2003-03-26T00:00:00Z
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.
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05B20
zbMATH DE Number: 1888437
reviewed by: Esther R. Lamken
MaRDI profile type: Publication
cites work: Q4877004
cites work: Q4184849
cites work: Q4718791
cites work: Q4876961
cites work: Q4876941
cites work: Q4723751
cites work: A technique for constructing symmetric designs
cites work: New families of strongly regular graphs
cites work: On spectra of doubly regular asymmetric digraphs of \(RH\)-type
cites work: Nearly triply regular DRAD's of \(RH\) type
cites work: On Automorphism Groups of Divisible Designs
cites work: Q4876949
cites work: Perfect codes and balanced generalized weighing matrices
cites work: Q3708813
cites work: On the twin designs with the Ionin-type parameters
cites work: On a class of symmetric balanced generalized weighing matrices
cites work: Tournaments and Hadamard matrices
cites work: Q4876925
description: scientific article; zbMATH DE number 1888437