Almost Moore digraphs are diregular (Q1978162): Difference between revisions

A digraph of maximum out-degree \(d\), diameter \(k\), and order \(n=M_{d,k}:=1+d^1+d^2+\dots +d^k\) is called a Moore digraph. Every Moore digraph is a cycle or a complete digraph as shown by the reviewer and \textit{Š. Znám} [Acta Fac. Rer. Natur. Univ. Comenian., Math. 29, 29-34 (1974; Zbl 0291.05106)]. Thus it is diregular (i.e. all its out-degrees and in-degrees are equal to \(d\)). In this paper the authors show that also almost Moore digraphs (i.e. if \(n=M_{d,k}-1\)) are diregular. Moreover they give examples of digraphs with \(n=M_{d,k}-2\) or \(n=M_{d,k}-3\) which are not diregular.