A Question

Revision en2, by Mohammad.H915, 2019-09-24 13:07:07

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.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Mohammad.H915 2019-09-24 13:07:07 502
en1 English Mohammad.H915 2019-09-24 11:54:43 133 Initial revision (published)