一个三色有向图D是本原的,当且仅当存在非负整数h、k和v,且h+k+v〉0,使得D中的每一对顶点(i,j)都存在从i到j的(h,k,v)-途径,h+k+v的最小值定义为三色有向图D的本原指数.研究了一类三色有向图,它的未着色图中包含2佗-4个顶点,一个n-圈、一个(n-2)-圈和一个2-圈,给出了本原指数上界.
A three-colored digraph D is primitive if and only if three exists nonnegative integers h, k and v with h + k + v 〉 0 such that for each pair (i, j) of vertices there exists a (h, k, v)-walk in D from i to j. The exponent of the primitive three-colored digraph D is the minimum value of h + k + v taken over all such h, k and v. A class of three-colored digraphs were studied whose uncolored digraph has 2n - 4 vertices, consists of one n-cycle, one (n - 2) -cycle and one 2-cycle. The tight upper bound on the primitive exponent were given.