Common minimal dominating graph

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

A common minimal dominating graph of [math]\displaystyle{ G }[/math] is defined as the graph having the same vertex set as [math]\displaystyle{ G }[/math] with two vertices adjacent if there is a minimal dominating set containing both vertices.