Digraphs with degree two and excess two are diregular
classification
🧮 math.CO
keywords
epsilonexcessdigraphdiregularout-degreedegreedigraphsminimum
read the original abstract
A $k$-geodetic digraph with minimum out-degree $d$ has excess $\epsilon $ if it has order $M(d,k) + \epsilon $, where $M(d,k)$ represents the Moore bound for out-degree $d$ and diameter $k$. For given $\epsilon $, 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 $\epsilon = 1$ must be diregular. In this paper we prove that digraphs with minimum out-degree $d = 2$ and excess $\epsilon = 2$ are diregular for $k \geq 2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.