摘要
主要考虑一个含有三个圈的本原有向图.利用图论和数论的相关知识,通过分析图中每一点通过t长途径所到达顶点的集合及顶点的个数,得出本原有向图的scrambling指数以及广义的scrambling指数.
A primitive digraph with three cycles is discussed. On the basis of graph theory and number theory, and through analyses of the vertex set of each vertex in digraph which can be reached by a walk of length t, the scrambling index and generalized scrambling indices of this primitive digraph are given.
出处
《广西师范学院学报（自然科学版）》
2015年第2期6-9,29,共5页
Journal of Guangxi Teachers Education University(Natural Science Edition)
基金
山西省回国留学人员科研资助项目(NO.2012-070)
