ON THE UPPER GENERALIZED EXPONENTS OF MINISTRONG DIGRAPHS

A digraph G is called primitive if there ekists a positive integer k such that there isa walk of length k from u to v for each ordered pair of not necessarily distinct vertices uand v. The smallest such k is called the exponent of G, denoted by γ(G). Exponents forprimitive digraphs have been studied extensively due to their intrinsic importance in graphtheory, combinatorics, matrix theory, and their applications in communication problems. Asa generalization of exponents, Brualdi and Liu1] …