Well-located graph

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

Well-located graph --- хорошо размещённый граф.

A dominating set, say D, it said to be located if, for every pair of vertices not in the set D, their neighbours that are in D differ in at least one vertex. A graph is called well-located, if it has the property that every independent dominating set is located.