2-Competition Index of Primitive Digraphs Using Graph Theory  

作　　者：方炜 高玉斌 李忠善 

机构地区：[1]School of Instrument and Electronic,North University of China [2]Department of Mathematics,North University of China [3]Department of Mathematics and Statistics,Georgia State University

出　　处：《Journal of Donghua University(English Edition)》2014年第3期320-324,共5页东华大学学报（英文版）

基　　金：National Natural Science Foundations of China(No.11272100,No.50865001)

摘　　要：Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled.Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」＋ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled.

关 键 词：2-competition index primitive digraphs minimally strong digraphs 

分 类 号：O157.5[理学—数学] S791.248[理学—基础数学]