Well-located graph
Материал из WikiGrapp
Well-located graph --- хорошо размещённый граф.
A dominating set, say [math]\displaystyle{ D }[/math], it said to be located if, for every pair of vertices not in the set [math]\displaystyle{ D }[/math], their neighbours that are in [math]\displaystyle{ D }[/math] differ in at least one vertex. A graph is called well-located, if it has the property that every independent dominating set is located.
