The Orders of Orientation Distance Graphs of Cycles
Ren Qiu-dao · Journal of Sichuan Normal University · 2005
For two nonisomorphic orientations D and D′ of a graph G, the orientation distance d_0(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 D_0(G) of G has the set O(G) of pairwise nonisomorphic orientations of G as its vertex set and two vertices D and D′ of D_0(G) are adjacent if and only if d_0(D,D′)=1. This paper determines that the order |O(c_n)| of orientation distance graphs of cycles.