一个含4个圈的本原有向图的 scrambling指数及广义 scrambling指数

摘要

Through analyses the vertex set of each vertex in digraph can be reached by a walk of length t , and combining with graph theory and combinational theory , we get the scrambling index and generalized scrambling indices of the primitive digraph with two s-cycles and two(s-1)-cycles.%通过分析图中每一点通过t长途径所到达顶点的集合及顶点的个数，并且结合图论及组合数学的知识，得到一个含有两个s圈和两个s －1圈的本原有向图的scrambling指数以及广义scrambling指数。