Almost Moore digraphs are diregular
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.
- Eulogy for Professor Mirka Miller (1949--2016)
- On digraphs of excess one
- Digraphs with degree two and excess two are diregular
- On total regularity of mixed graphs with order close to the Moore bound
- On the nonexistence of almost Moore digraphs
- Enumerations of vertex orders of almost Moore digraphs with selfrepeats
- On the nonexistence of almost Moore digraphs of degree four and five
- Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
- On mixed almost Moore graphs of diameter two
- On diregularity of digraphs of defect at most two
- scientific article; zbMATH DE number 1735799 (Why is no real title available?)
- scientific article; zbMATH DE number 1792622 (Why is no real title available?)
- Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
- On the weak distance-regularity of Moore-type digraphs
- Enumeration of almost Moore digraphs of diameter two
- New results regarding the permutation cycle structure of almost Moore digraphs
- On the nonexistence of almost Moore digraphs with self-repeats
- Multipartite Moore digraphs
This page was built for publication: Almost Moore digraphs are diregular
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978162)
