M. MATINFAR - Department of Mathematics, University of Mazandaran, P. O. Box 47416 - 1467, Babolsar, Iran.. S. MIRZAMANI - Department of Mathematics, University of Mazandaran, Babolsar, Iran..
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.
M. MATINFAR, S. MIRZAMANI, A NOT ON DOMINATING SET WITH MAPLE, Journal of Nonlinear Sciences and Applications, 1 (2008), no. 1, 5-11
MATINFAR M., MIRZAMANI S., A NOT ON DOMINATING SET WITH MAPLE. J. Nonlinear Sci. Appl. (2008); 1(1):5-11
MATINFAR , M., MIRZAMANI, S.. "A NOT ON DOMINATING SET WITH MAPLE." Journal of Nonlinear Sciences and Applications, 1, no. 1 (2008): 5-11
