Almost Moore digraphs are diregular (Q1978162): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Jozef Širáň / rank | |||
Property / author | |||
Property / author: S. Slamin / rank | |||
Property / author | |||
Property / author: Jozef Širáň / rank | |||
Normal rank | |||
Property / author | |||
Property / author: S. Slamin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:26, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Almost Moore digraphs are diregular |
scientific article |
Statements
Almost Moore digraphs are diregular (English)
0 references
15 August 2000
0 references
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.
0 references
almost Moore digraph
0 references
degree
0 references
diameter
0 references
diregular
0 references