On dominating the Cartesian product of a graph and K₂
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 389-402
Voir la notice de l'article provenant de la source Library of Science
In this paper we consider the Cartesian product of an arbitrary graph and a complete graph of order two. Although an upper and lower bound for the domination number of this product follow easily from known results, we are interested in the graphs that actually attain these bounds. In each case, we provide an infinite class of graphs to show that the bound is sharp. The graphs that achieve the lower bound are of particular interest given the special nature of their dominating sets and are investigated further.
Keywords:
domination, 2-packing, Cartesian product
@article{DMGT_2004_24_3_a2,
author = {Hartnell, Bert and Rall, Douglas},
title = {On dominating the {Cartesian} product of a graph and {K₂}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {389--402},
publisher = {mathdoc},
volume = {24},
number = {3},
year = {2004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a2/}
}
TY - JOUR AU - Hartnell, Bert AU - Rall, Douglas TI - On dominating the Cartesian product of a graph and K₂ JO - Discussiones Mathematicae. Graph Theory PY - 2004 SP - 389 EP - 402 VL - 24 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a2/ LA - en ID - DMGT_2004_24_3_a2 ER -
Hartnell, Bert; Rall, Douglas. On dominating the Cartesian product of a graph and K₂. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 389-402. http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a2/