Dominating path
Материал из WikiGrapp
Dominating path --- доминирующий путь.
A path [math]\displaystyle{ P }[/math] in [math]\displaystyle{ G }[/math] is called dominating if the vertices of the graph [math]\displaystyle{ G - P }[/math] are independent.
