Doubly regular digraphs and symmetric designs

Authors:
Yury J. Ionin;Hadi Kharaghani
Affiliations:
Department of Mathematics, Central Michigan University, Mt. Pleasant, MI;Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, Canada T1K 3M4
Venue:
Journal of Combinatorial Theory Series A
Year:
2003

Citing 4
Cited 2

Design theory

Design theory
A Technique for Constructing Symmetric Designs

Designs, Codes and Cryptography
On a Class of Symmetric Balanced Generalized Weighing Matrices

Designs, Codes and Cryptography
Perfect Codes and Balanced Generalized Weighing Matrices

Finite Fields and Their Applications

Mediated digraphs and quantum nonlocality

Discrete Applied Mathematics - Special issue: Max-algebra
Communication: Mediated digraphs and quantum nonlocality

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

If an incidence matrix N of a symmetric design is such that N + Nt is a (0, 1) matrix, then N is an adjacency matrix of a doubly regular asymmetric digraph, and vice versa. We construct several parametrically new infinite families of such digraphs. To carry on some of these constructions, we obtain an infinite family of skew balanced generalized weighing matrices.