The structure of digraphs with excess one.

A digraph G $G$ is k $k$‐geodetic if for any (not necessarily distinct) vertices u,v $u,v$ there is at most one directed walk from u $u$ to v $v$ with length not exceeding k $k$. The order of a k $k$‐geodetic digraph with minimum out‐degree d $d$ is bounded below by the directed Moore bound M(d,k)=1+d+d2+⋯+dk $M(d,k)=1+d+{d}^{2}+\cdots +{d}^{k}$. The Moore bound can be met only in the trivial cases d=1 $d=1$ and k=1 $k=1$, so it is of interest to look for k $k$‐geodetic digraphs with out‐degree d $d$ and smallest possible order M(d,k)+ϵ $M(d,k)+{\epsilon }$, where ϵ ${\epsilon }$ is the excess of the digraph. Miller, Miret and Sillasen recently ruled out the existence of digraphs with excess one for k=3,4 $k=3,4$ and d≥2 $d\ge 2$ and for k=2 $k=2$ and d≥8 $d\ge 8$. We conjecture that there are no digraphs with excess one for d,k≥2 $d,k\ge 2$ and in this paper we investigate the structure of minimal counterexamples to this conjecture. We severely constrain the possible structures of the outlier function and prove the nonexistence of certain digraphs with degree three and excess one, as well closing the open cases k=2 $k=2$ and d=3,4,5,6,7 $d=3,4,5,6,7$ left by the analysis of Miller et al. We further show that there are no involutary digraphs with excess one, that is, the outlier function of any such digraph must contain a cycle of length ≥3 $\ge 3$. [ABSTRACT FROM AUTHOR]