Orientation distance graph

Материал из WikiGrapp
Перейти к навигации Перейти к поиску

Orientation distance graph --- граф расстояний ориентаций.

The orientation distance graph [math]\displaystyle{ {\mathcal D}_{o}(G) }[/math] of a graph [math]\displaystyle{ G = (V,E) }[/math] has a vertex set [math]\displaystyle{ {\mathcal O}(G) }[/math], the collection of pair-wise nonisomorphic orientations of [math]\displaystyle{ G }[/math]. Adjacency is defined between two orientations iff the reversal of one arc in one orientation generates (an orientation isomorphic to) the other.