TY - JOUR AU - MATINFAR , M. AU - MIRZAMANI, S. PY - 2008 TI - A NOT ON DOMINATING SET WITH MAPLE JO - Journal of Nonlinear Sciences and Applications SP - 5-11 VL - 1 IS - 1 AB - 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. SN - ISSN 2008-1901 UR - http://dx.doi.org/10.22436/jnsa.001.01.02 DO - 10.22436/jnsa.001.01.02 ID - MATINFAR 2008 ER -