Primitive digraphs with smallest large exponent (Q2477548)

The paper shows that the minimum number of arcs in a primitive digraph on \(n > 4\) vertices with large exponent is either \(n + 1\) or \(n + 2\). A necessary and sufficient condition is given for the existence of a primitive digraph on \(n\) vertices with large exponent and \(n + \)1 arcs, thereby giving an algorithm that determines for fixed n whether the minimum number of arcs is \(n + 1\) or \(n + 2\).