Primitive Exponent Set of a Class of Special Two-colored Digraphs
Yubin Gao · Journal of Taiyuan University of Science and Technology · 2006
A two-colored digraph 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)-path in D from i to j.The exponent of the primitive two-colored digraph D is the minimum value of h+k taken over all such h and k.In this paper,we give the exponent set of a class of primitive two-colored digraphs,and the characterizations of the extreme two-colored digraphs.