本原极小强连通有向图的重下scrambling指数

Lower Scrambling Indices of Primitive Minimally Strong Digraphs

利用图论、数论的相关知识,分析了图中每一点经过t长途径所到达的点的集合,再结合scrambling指数和重下scrambling指数的定义刻画了本原极小强连通有向图的重下scrambling指数的界.

On the basis of graph theory and number theory, we analyse the vertices set of each vertices which can be reached by a walk of length t in digraph. And by using the definitions of the scrambling index and the lower scrambling indices, we investigate the bounds of the lower scrambling indices of the primitive minimally strong digraphs.