On the exponents of primitive, ministrong digraphs with shortest elementary circuit length \(s\) (Q1894467)

Let \(b(s, n)= \max \gamma(D)\), where \(\gamma(D)\) is the primitive exponent of the digraph \(D\), and the maximum runs over all primitive ministrong digraphs \(D\) of order \(n\) with the shortest cycle of length \(s\). So far the value of \(b(s, n)\) has been known only for the case \(\text{gcd}(n- 1,s)= 1\). In the paper the authors determine \(b(s, n)\) in the other case, and characterize digraphs with the property \(\gamma(D)= b(s, n)\) for \(s\neq 2 ,6\).