中北大学学报（自然科学版）2011，Vol.32Issue(6)：655-661,7.DOI:10.3969/j.issn.1673-3193.2011.06.001
一类双色有向图的指数上界
A Upper Bound on the Exponents of a Class of Two-Colored Digraphs
摘要
Abstract
A two-colored digraphs D is primitive if there exist nonnegative integers h and k with h+k>0 such that for each pair (I,j) of vertices there exists an (h,k)-walk in D from I to j. Then the minimum value of h+k is called D of the primitive exponent. The special two-colored digraphs whose uncolored digraph have 2n-t - 2 vertices and consist of one n-cycle and one (n - t)-cycle was considered. Some primitive conditions and an upper bound on the exponents were given, and the characterizations of extremal two-colored digraphs were discribed.关键词
本原条件/双色有向图/指数/上界/极图Key words
primitive condition/ two-colored digraph/ exponent/ upper bound/ extremal digraph分类
数理科学引用本文复制引用
孙涛,王建中,罗美金..一类双色有向图的指数上界[J].中北大学学报（自然科学版）,2011,32(6):655-661,7.基金项目
山西省青年科技研究基金资助项目(2006021006) （2006021006）
