根据图论和数论的相关知识，对本原有向图中每一点经过k长途径所到达点的集合进行了分析，进而得出一个特殊的本原有向图的广义competition指数以及该图的广义scrambling指数。%Based on the related knowledge of graph theory and the number theory, and by analyzing the vertex set of each vertex in digraph can be reached by a walk of length k, generalized competition indices and generalized scrambling indices of one special primitive digraph are given.
展开▼
