@Article{MATINFAR 2008,
author="M. MATINFAR , S. MIRZAMANI",
title="A NOT ON DOMINATING SET WITH MAPLE",
year="2008",
volume="1",
number="1",
pages="5-11",
abstract="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.",
issn="ISSN 2008-1901",
doi="10.22436/jnsa.001.01.02",
url="http://dx.doi.org/10.22436/jnsa.001.01.02"
}