Просмотр кода страницы K-Restricted total domination number

'''<math>k</math>-Restricted total domination number''' --- число
<math>k</math>-ограниченного тотального доминирования. 

The ''' <math>k</math>-restricted total domination number''' of a graph <math>G</math> is the
smallest integer <math>r_{k}(G,\gamma_{t})</math> such that, given any subset
<math>U</math> of <math>k</math> vertices of <math>G</math>, there exists a ''total dominating set''
of <math>G</math> of cardinality at most <math>r_{k}(G,\gamma_{t})</math> containing <math>U</math>.
Hence, the <math>k</math>-restricted total domination number of a graph <math>G</math>
measures how many vertices are necessary to totally dominate a graph
if an arbitrary set of <math>k</math> vertices must be included in the total
dominating set. When <math>k = 0</math>, the <math>k</math>-restricted total domination
number is the '''total domination number'''.