Dominating graph

Dominating graph --- доминирующий граф.

A dominating graph [math]\displaystyle{ D(G) }[/math] is the graph with [math]\displaystyle{ V(D(G)) = V(G) \cup S(G) }[/math], where [math]\displaystyle{ S(G) }[/math] is the set of all minimal dominating sets of [math]\displaystyle{ G }[/math], and two vertices [math]\displaystyle{ u,v \in V(D(G)) }[/math] are adjacent if [math]\displaystyle{ u \in V(G) }[/math] and [math]\displaystyle{ v = D }[/math] is a minimal dominating set containing [math]\displaystyle{ u }[/math].