Digraphs of degree two which miss the Moore bound by two
From MaRDI portal
(Redirected from Digraphs of degree two which miss the Moore bound by two)
Given positive integers \(d\) and \(k\), the order \(n\) of a digraph of out-degree at most \(d\) and diameter at most \(k\) is bounded from above by the Moore bound \(M_{d,k}=1+d+d^2+\cdots +d^k\). As shown by the reviewer and \textit{S. Znám} [Acta Fac. Rer. Nat. Univ. Comenian., Math. 29, 29-34 (1974; Zbl 0291.05106)] the equality holds only if \(d=1\) or \(k=1\). In this paper the nonexistence of digraphs of out-degree 2 and diameter \(k\geq 3\) is shown whenever the defect \(M_{d,k}-n=2.\)
Recommendations
Cited in
(8)- On digraphs of excess one
- On diregular digraphs with degree two and excess two
- On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
- Digraphs with degree two and excess two are diregular
- On diregular digraphs with degree two and excess three
- On diregularity of digraphs of defect at most two
- On (4, 2)-digraphs containing a cycle of length 2
- Graphs of order two less than the Moore bound
This page was built for publication: Digraphs of degree two which miss the Moore bound by two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841909)
