TY - JOUR
AU - MATINFAR , M.
AU - MIRZAMANI, S.
PY - 2008
TI - A NOT ON DOMINATING SET WITH MAPLE
JO - Journal of Nonlinear Sciences and Applications
SP - 5-11
VL - 1
IS - 1
AB - 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.
SN - ISSN 2008-1901
UR - http://dx.doi.org/10.22436/jnsa.001.01.02
DO - 10.22436/jnsa.001.01.02
ID - MATINFAR 2008
ER -
TY - JOUR
TI - An inequality related to Vizing’s conjecture
AU - W. E. Clark
AU - S. Suen
JO - Electron. J. Combin.
PY - 2000
DA - 2000//
VL - 7(1)
ID - Clark2000
ER -
TY - JOUR
TI - Domination in Cartesian Products: Vizing’s Conjecture
AU - B. Hartnell
AU - D. F. Rall
JO - Domination in Graphs–Advanced Topics, New York, Dekker
PY - 1998
DA - 1998//
VL -
ID - Hartnell1998
ER -
TY - BOOK
TI - Domination in Graphs: Advanced Topics
AU - T. W. Haynes
AU - S. T. Hedetniemi
AU - P. J. Slater
PB - Marcel Dekker, New York, Marcel Dekker, Inc.
PY - 1998
DA - 1998//
CY - NewYork
ID - Haynes1998
ER -
TY - JOUR
TI - Paths, stars, and the number three
AU - B. Read
JO - combin. probab. comput.
PY - 1996
DA - 1996//
VL - 5
ID - Read 1996
ER -