On the number of arcs in primitive digraphs with large exponents Original Research Article

A digraph G is called primitive if for some positive integer k, there is a walk of length exactly k from each vertex u to each vertex v (possibly u again). If G is primitive, the smallest such k is called the exponent of G, denoted by exp(G). For any real number r, 0