考虑2个含有3个圈(其中2个圈的长度相等但不相交)的特殊本原有向图.通过分析图中每一点经过t长途径所到达的点的集合及点的个数,给出了此类图的Scrambling指数和广义Scrambling指数.
Two special primitive digraphs each of which contains three cycles, two cycles of which do not intersect but the lengths are equal are studied. Through analyses of the vertex set of each vertex in digraph can be reached by a walk of length t, the Scrambling indices and generalized Scrambling indices of such digraphs are given.