Digraphs with degree two and excess two are diregular
Abstract
A k-geodetic digraph with minimum out-degree d has excess ε if it has order M(d,k) + ε , where M(d,k) represents the Moore bound for out-degree d and diameter k. For given ε , it is simple to show that any such digraph must be out-regular with degree d for sufficiently large d and k. However, proving in-regularity is in general non-trivial. It has recently been shown that any digraph with excess ε = 1 must be diregular. In this paper we prove that digraphs with minimum out-degree d = 2 and excess ε = 2 are diregular for k ≥ 2.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.