As a generalization of the scrambling index and the exponent,m-competition index has been widely applied to stochastic matrices,food webs and memoryless communication systems in recent years. For a positive integer m,...As a generalization of the scrambling index and the exponent,m-competition index has been widely applied to stochastic matrices,food webs and memoryless communication systems in recent years. For a positive integer m,where 1 ≤ m ≤ n,the mcompetition index( generalized competition index) of a primitive digraph D of order n is the smallest positive integer k such that for every pair of vertices x and y,there exist m distinct vertices v_1,v_2,…,v_m such that there exist walks of length k from x to v_i and from y to v_i for 1 ≤ i ≤ m. By analyzing the structure of θ-graphs( theta graphs) and using enumeration investigation methods,the mcompetition indices of primitive θ-graphs are studied and an upper bound is provided. Moreover, some corresponding extremal θ-graphs are characterized.展开更多
The exponent of a primitive digraph has been generalized in [2].In this paper we obtain new parameters on generalized exponent of primitive simple graphs (symmetric primitive (0,1)matrices with zero trace) completely.
基金Shanxi Scholarship Council of China(No.2012-070)Foundation of North University of China(No.2013-12-1)
文摘As a generalization of the scrambling index and the exponent,m-competition index has been widely applied to stochastic matrices,food webs and memoryless communication systems in recent years. For a positive integer m,where 1 ≤ m ≤ n,the mcompetition index( generalized competition index) of a primitive digraph D of order n is the smallest positive integer k such that for every pair of vertices x and y,there exist m distinct vertices v_1,v_2,…,v_m such that there exist walks of length k from x to v_i and from y to v_i for 1 ≤ i ≤ m. By analyzing the structure of θ-graphs( theta graphs) and using enumeration investigation methods,the mcompetition indices of primitive θ-graphs are studied and an upper bound is provided. Moreover, some corresponding extremal θ-graphs are characterized.
文摘The exponent of a primitive digraph has been generalized in [2].In this paper we obtain new parameters on generalized exponent of primitive simple graphs (symmetric primitive (0,1)matrices with zero trace) completely.
