圈的定向距离图的性质

Characteristics of Orientation Distance Graphs of Cycles

图G的两个定向D与D'的定向距离d0(D,D')是指与D'同构的定向与D之间不相同的弧数的最小值.G的定向距离图D0(G)的顶点是互不同构的定向,如果d0(D,D')=1,则D与D'在D0(G)中相邻,并获得定向距离图D0(Cn)的性质.

For two nonisomorphic orientations D and D＇of a graph G, the orientation distance do （D,D＇） between D and D＇is the minimum number of arcs of D whose directions must be reversed to produce an orientation isomorphic to D： The orientation distance graph DO （G） of G has the set O（C） of pairwise nonisomorphic orientations of G as its vertex set and two vertices D and D＇of DO （G） are adjacent if and only if do （D,D＇） = 1. This paper obtains characteristics of orientation distance graphs of cycles.