一个n阶本原有向图的m-competition指数  

The m-competition index of a primitive digraph of order n

作　　者：刘彩锋 高玉斌[1] 

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

出　　处：《商丘师范学院学报》2015年第9期1-6,共6页Journal of Shangqiu Normal University

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

摘　　要：文中讨论了一个含有一个n-2圈和一个n-3圈的n阶本原有向图D.由D的结构得到本原图Dn-2和Dn-3,然后分别对本原图D,Dn-2和Dn-3中任一点经过k长途径所到达的顶点的集合以及顶点的个数进行分析,再结合m-competition指数的定义,得到这个本原图的m-competition指数.In this paper,a primitive digraph D of order n with one（ n- 1）- cycle and one（ n- 2）- cycle is considered. According to the structure of D,we draw up the primitive digraphs Dn-2and Dn-3. Then the sets and the numbers of vertexes,which are formed by each vertex passing a walk of length k in the primitive digraphs D,Dn-2and Dn-3are discussed respectively. In addition,based on the definition of m- competition index,we work out the m- competition index of the primitive digraph.

关 键 词：有向图 本原图 m-competition指数 

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