Affiliation:
1. Hechi University Yizhou
Abstract
A two-colored directed digraph D is primitive if and only if there exist nonnegative integers h and k with h+k>0 such that for each pair (i,j) of vertices there is a (h,k)-walk in D from i to j. The exponent of the primitive two-colored digraph D is defined to be the smallest value of h+k over all suchand . With the knowledge of graph theory, a class of two-colored digraphs with two cycles whose uncolored digraph has 3n vertices and consists of one (2n+1)-cycle and one n-cycle is considered.The exponent bound, exponent set and characteristic of extral two-colored digraphs are given.
Publisher
Trans Tech Publications, Ltd.
Reference9 articles.
1. Yubin Gao, Yanling Shao, Exponents of two-colored double directed cycles, Journal of Heilongjiang University (Natural Science Edition) , vol 4(2004), pp.55-58.
2. B.L. Shader, S. Suwilo, Exponents of nonnegative matrix pairs, Linear Algebra Appl, vol. 363 (2003), pp.275-293.
3. A. Berman, R. Plemmons, Nonnegative Matrices in the Mathematical Science, Classics in Applied Mathematics. Vol. 9, SIAM, Philadelphia, PA, (1994).
4. R.A. Brualdi, H.J. Ryser, Combinatorial Matrix Theory, Encyclopedia of Mathematics and its Applications, vol. 39, Cambridge University Press, Cambridge, (1991).
5. Yubin Gao, Yanling Shao, Exponents of two-colored digraphs with two cycles, Linear Algebra Appl, vol. 407(2005), pp.263-270.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献