Просмотр кода страницы Locating-dominating set

'''Locating-dominating set''' --- размещённое доминирующее множество.

Slater (1987) defined a '''locating-dominating set''', denoted by an
''LD''-set, in a connected graph <math>G</math> to be a dominating set <math>D</math> of <math>G</math>
such that for every two vertices <math>u</math> and <math>v</math> in <math>V(G) - D</math>, <math>N(u) \cap
D \neq N(v) \cap D</math>. The '''location-domination number'''
<math>\gamma_{L}(G)</math> is the minimum cardinality of an ''LD''-set for <math>G</math>.