Projektdetaljer
Beskrivelse
A regular digraph in which the number of common out-neighbours of two vertices depend only on the adjacency between the vertices is called a normally regular digraph. The motivation for studying these digraphs came from investigation of large bipartite graphs with small diameter. Normally regular digraphs generalize non-symmetric 3-class association schemes.
We find several constructions and some non-existence results and results
characterizing normally regular digraphs with certain parameters.
| Status | Afsluttet |
|---|---|
| Effektiv start/slut dato | 01/01/2008 → 01/01/2018 |
Finansiering
- <ingen navn>
Fingerprint
Udforsk forskningsemnerne, som dette projekt berører. Disse etiketter er oprettet på grundlag af de underliggende bevillinger/legater. Sammen danner de et unikt fingerprint.