ブラウザの設定でJava Scriptの使用を有効にしてご利用ください。
出典:Wiktionary
dominating set (複数形 dominating sets)
出典:Wikipedia
出典:『Wikipedia』 (2011/05/31 19:23 UTC 版)
In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at least one member of D by some edge. The domination number γ(G) is the number of vertices in a smallest dominating set for G.
Dominating Set