@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"
}
@Article{Clark2000,
author="W. E. Clark, S. Suen",
title=" An inequality related to Vizing’s conjecture",
journal="Electron. J. Combin. ",
year="2000",
pages="3 (electronic)",
volume="7(1)"
}
@Article{Hartnell1998,
author="B. Hartnell, D. F. Rall",
title="Domination in Cartesian Products: Vizing’s Conjecture",
journal="Domination in Graphs–Advanced Topics, New York, Dekker",
year="1998",
pages="163-189",
volume=""
}
@Book{Haynes1998,
author="T. W. Haynes, S. T. Hedetniemi, P. J. Slater ",
title="Domination in Graphs: Advanced Topics",
year="1998",
publisher=" Marcel Dekker, New York, Marcel Dekker, Inc. ",
address="NewYork"
}
@Article{Read 1996,
author="B. Read ",
title="Paths, stars, and the number three",
journal="combin. probab. comput.",
year="1996",
pages="277-295.",
volume="5"
}