在图Ds,n的基础上,增加1个s长圈,研究含有1个n长圈和2个s长圈(2个s长圈有公共顶点)的本原有向图通过分析图中每个点经过t长途径所到达的点的集合及点的个数,得出此类本原有向图的scrambling指数.
Based on the graph Ds,n, one s-cycle is added. The primitive digraph of order n with one n-cycle and two s-cycles where the two s-cycles have common vertexes is studied. By analyzing the vertex set of each vertex in digraph can be reached by a walk of length t, the scrambling index of such primitive digraph is obtained.