A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
Let G be a n− vertex graph. In 1996, Reed conjectured that γ(G) ≤ n/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.doi:10.22436/jnsa.001.01.02 fatcat:bug7bucb6zc5vckltt3adgm7fi