Maple Procedure for Calculate of Dominating Set

Let G is n- vertex graph. In 1996, Reed conjectured that for every connected3- regular G. In this paper, we introduce an algorithm in computer algebra system of M APLEsuch that, by using any graph as input, we can calculate domination number y(G) and illustratedset of all dominating sets. It important that these sets choose among between sets.