Let \(G\) be a n− vertex graph. In 1996, Reed conjectured that \(\gamma(G)\leq\lceil \frac{n}{3}\rceil\) for every connected 3− regular \(G\). In this paper, we introduce an algorithm in computer algebra system of MAPLE such that, by using any graph as input, we can calculate domination number \(\gamma(G)\) and illustrated set of all dominating sets. It important that these sets choose among between (\(n, \gamma(G))\) sets.