Dominating set

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 adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G.

单词	Dominating set
释义	Dominating set 英语百科 Dominating set 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 adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G.
随便看	instant jelly instant journalism instant jump Instant Karma instantlie instant loading device instant lock Instantlod instant lottery instantly instantly acting time limit resetting system instant macaroni instantmail instant map instant mash Instant mashed potato Instant mashed potatoes Instant Message instant messaged Instant messages Instant messaging instant messaging bot Instant Messenger Instant Messengers Instant milk