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

Lower Scrambling Indices of Primitive Minimally Strong Digraphs

作　　者：尹作香[1] 邵燕灵[1] 

机构地区：[1]中北大学数学系,太原030051

出　　处：《河南师范大学学报（自然科学版）》2012年第6期8-11,共4页Journal of Henan Normal University(Natural Science Edition)

基　　金：国家自然科学基金(11071227);山西省回国留学人员科研资助项目

摘　　要：利用图论、数论的相关知识,分析了图中每一点经过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.

关 键 词：SCRAMBLING指数 重下scrambling指数 本原有向图 途径 界 

分 类 号：O157.5[理学—数学]