Просмотр кода страницы Exact n-step domination graph

'''Exact <math>n</math>-step domination graph''' --- граф точного <math>n</math>-шагового
доминирования. 

A vertex <math>u</math> in a graph <math>G</math> is said to <math>n</math>-step dominate a vertex <math>v</math>
if <math>d(u,v) = n</math>. If there exists a subset <math>S \subseteq V(G)</math> such that
each <math>v \in V(G)</math> is <math>n</math>-step dominated by exactly one vertex in <math>S</math>,
then <math>G</math> is an '''exact <math>n</math>-step domination graph''' and <math>S</math> is called
an '''exact <math>n</math>-step dominating set'''.