Minimal dominating graph

Minimal dominating graph --- минимальный доминирующий граф.

The minimal dominating graph of [math]\displaystyle{ G }[/math] is the intersection graph on the minimal dominating sets of vertices of [math]\displaystyle{ G }[/math].