MAPLE PROCEDURE FOR CALCULATE OF DOMINATING SET
M. Matinfar, Somayeh Mirzamani · 2008
Let G is nvertex graph. In 1996, Reed conjectured that n (G) 3 � � γ ≤ � � � � 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 (G) γ and illustrated set of all dominating sets. It important that these sets choose among between n (G) � � � � γ � sets.