There are no excess one digraphs

Slobodan Filipovski, Arnau Messegué, Josep M. Miret +1

A digraph $G$ is \emph{$k$-geodetic} if for any pair $u,v\in V(G)$ there is at most one $u,v$-walk of length not exceeding $k$. The order of a $k$-geodetic digraph with minimum ou…