Mohammad.H915's blog

A Question
By Mohammad.H915, history, 5 years ago, In English

Can someone help me to find the Minimum Dominating Set of a Simple Graph with n <= 75

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.

  • Vote: I like it
  • -7
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Please describe what is dominating set of graph

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Mohammad.H915 (previous revision, new revision, compare).

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

please help me.

→ Reply