Doubly regular asymmetric digraphs
type: Item
instance of: scholarly article
title: Doubly regular asymmetric digraphs
zbMATH Open document ID: 0661.05029
DOI: 10.1016/0012-365X(88)90208-7
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: Let \(D=(P,B)\) be a symmetric design where P and B are the sets of points and blocks, respectively. If T is a bijection from B to P satisfying the conditions i) for every block a, T(a)\(\not\in a\), ii) if T(a)\(\in b\), then T(b)\(\not\in a\), then the author associates with D a digraph G in the following way: the set of vertices of G equals P and (u,v) is an arc of G if \(v\in T^{-1}(u).\) In the paper some basic properties of the graphs obtained in this manner are shown.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 4079452
zbMATH Keywords: symmetric block design
zbMATH Keywords: regular asymmetric digraph
author: Noboru Ito
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Q4198777
cites work: Q5683869
cites work: Hadamard tournaments with transitive automorphism groups
cites work: Q3851094
cites work: Q3342600
full work available at URL: 0012-365x(88)90208-7
OpenAlex ID: W1996335860
Recommended article: Q3487371
Recommended article: Q4036205
Recommended article: Doubly regular digraphs and symmetric designs
Recommended article: On spectra of doubly regular asymmetric digraphs of \(RH\)-type
Recommended article: Digraph Laplacian and the Degree of Asymmetry
Recommended article: Q5203053
Recommended article: Dyck-Eulerian digraphs
Recommended article: Double vertex digraphs of digraphs
Recommended article: Asymmetric combinatorially-regular maps
Recommended article: Biregular edge-symmetric graphs
description: scientific article; zbMATH DE number 4079452