Common minimal dominating graph

Материал из WEGA

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.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.