Weighted domination number
Материал из WEGA
Weighted domination number --- взвешенное число доминирования.
The weighted domination number [math]\displaystyle{ \gamma_{w}(G) }[/math] of a weighted graph [math]\displaystyle{ (G,w) }[/math] is the minimum weight [math]\displaystyle{ w(D) = \sum_{w \in D} w(v) }[/math] of a set [math]\displaystyle{ D \subseteq V(G) }[/math] such that every vertex [math]\displaystyle{ x \in V(G) - D }[/math] has a neighbor in <math>D</ath>.
