期刊文献+

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

Them-competition index of a special primitive digraph of ordern
下载PDF
导出
摘要 研究了一个特殊n阶本原图.根据图论和数论的相关知识,对本原图中任一点经过k长途径所到达点的集合进行分析,再根据m-competition指数的定义,得到这个本原图的m-competition指数. A special primitive digraph of order n was studied.According to the relevant knowledge of graph theory and number theory,the sets of vertexes which are formed by every vertex passing a walk of length k in the primitive digraph were researched.In addition,based on the definition ofm -competition index,them -competition index of the primitive digraph was obtained.
作者 段洁 雷英杰
机构地区 中北大学理学院
出处 《高师理科学刊》 2015年第11期1-5,共5页 Journal of Science of Teachers'College and University
基金 国家自然科学基金资助项目(11071227)
关键词 本原图 本原指数 m-competition 指数 primitive digraph primitive exponent m -competition index
  • 相关文献

参考文献8

  • 1Brualdi R A, Ryser H J. Combinatorial Matrix Theory[M]. Cambridge: Cambridge University Press, 1991. 被引量:1
  • 2Akelbek M, Kirkland S. Coefficients of ergodicity and the scrambling index[J]. Linear Algebra and its Applications, 2009, 430 (4): 1111-1130. 被引量:1
  • 3Kim H K. Generalized competition index of a primitive digraph[J]. Linear Algebra and its Applications, 2010, 433 ( 1 ): 72-79. 被引量:1
  • 4Kim H K, Pank S G. A bound of generalized competition index of a primitive digraph[J]. Linear Algebra and its Applications, 2012, 436 ( 1 ): 86-98. 被引量:1
  • 5Shao Y L, Gao Y B. The m-competition indices of symmetric primitive digraphs with loop[J]. Ars Combination, 2013, 108 : 217-223. 被引量:1
  • 6Liu B L, Huang Y F. The scrambling index of primitive digraphs[J]. Computers and Mathematics with Applications, 2010, 60 (3) : 706-721. 被引量:1
  • 7Kim H K, Lee S H. Generalized competition indices of symmetric primitive digraphs[J]. Discrete Applied Mathematics, 2012, 160 ( 10-11 ) : 1553-1590. 被引量:1
  • 8Akelbek M, Kirkland S. Primitive digraphs with the largest scrambling index[J]. Linear Algebra and its Applications, 2009, 430 (4): 1099-1110. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部