The scrambling index of primitive digraphs

AbstractIn 2009, Akelbek and Kirkland introduced a useful parameter called the scrambling index of a primitive digraph D, which is the smallest positive integer k such that for every pair of vertices u and v, there is a vertex w such that we can get to w from u and v in D by directed walks of length k. In this paper, we obtain some new upper bounds for the scrambling index of primitive digraphs. Moreover, the maximum index problem, the extremal matrix problem and the index set problem for the scrambling index of various classes of primitive digraphs (e.g. primitive digraphs with d loops, minimally strong digraphs, nearly decomposable digraphs, micro-symmetric digraphs, etc.) are settled, respectively