Search
Now showing items 1-1 of 1
Diregularity of digraphs of out-degree three and order two less than Moore bound
(Proceeding of 12th Australasian Workshop on Combinatorial Algorithms, 2001)
It is easy to show that any digraph with out-degree at most $d \ge 2$, diameter $k \ge 2$ and order $n=d+d^2+\dots + d^k - 1$, that is, two less than Moore bound must have
all vertices of out-degree $d$. In other words, ...