Dominating walk

Dominating walk --- доминирующий маршрут. A dominating walk [math]\displaystyle{ W }[/math] in a graph [math]\displaystyle{ G }[/math] is a walk such that for each [math]\displaystyle{ v \in V(G) }[/math], either [math]\displaystyle{ v \in V(W) }[/math] or [math]\displaystyle{ v }[/math] is adjacent to a vertex of [math]\displaystyle{ W }[/math].