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.

If you be under 1599 when you want to register see that say :
You are registering "out of competition", reason: rating should be between 0 and 1,599 in order to register for the contest.

Please see it is wrong becuse the rating order is between 0 and 1599 but in codeforces we have a people under 0 and that mean they can not rate in div3 contest.
Look like : [problem:kiko_] and fxt

Iran ranked No. 7 in the IOI 2019 in Azerbijan with one gold and three silver.

GOLD MEDAL

1. Mahdi Jafari :: AghaTizi

SILVER MEDAL

1. Arshia soltani :: .ckodser.
2. Sayyed Mehrshad Mirmohammadi :: MAMBA
3. Kasra Mazaheri :: KMAASZRAA

I think that it good to be space for member comments for each question for when we solve or want to solve, but we do not spoil it.

I think that if MikeMirzayanov make a such space we can solve a problem with several ways.

Thank for reading my comment