]>
2008
1
1
ISSN 2008-1898
54
A NOT ON DOMINATING SET WITH MAPLE
A NOT ON DOMINATING SET WITH MAPLE
en
en
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.
5
11
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.
Minimum dominating set. MDS. Maple. Adjacency matrix.
Article.2.pdf
[
[1]
W. E. Clark, S. Suen, An inequality related to Vizing’s conjecture, Electron. J. Combin. , 7(1) (2000), 1-3
##[2]
B. Hartnell, D. F. Rall, Domination in Cartesian Products: Vizing’s Conjecture, Domination in Graphs–Advanced Topics, New York, Dekker, (1998), 163-189
##[3]
T. W. Haynes, S. T. Hedetniemi, P. J. Slater , Domination in Graphs: Advanced Topics, Marcel Dekker, New York, Marcel Dekker, Inc. , NewYork (1998)
##[4]
B. Read , Paths, stars, and the number three, combin. probab. comput., 5 (1996), 277-295
]