A dominating set D of G is called a split dominating set of G if the subgraph induced by the subset V(G)-D is disconnected. The cardinality of a minimum split dominating set is called the minimum split domination number of G. Such subset and such number was introduced in [4]. In [2], [3] the authors estimated the domination number of products of graphs. More precisely, they were study products of paths. Inspired by those results we give another estimation of the domination number of the conjunction (the cross product) Pₙ ∧ G. The split domination number of Pₙ ∧ G also is determined. To estimate this number we use the minimum connected domination number .
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1152,
author = {Maciej Zwierzchowski},
title = {A note on domination parameters of the conjunction of two special graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {21},
year = {2001},
pages = {303-310},
zbl = {1003.05080},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1152}
}
Maciej Zwierzchowski. A note on domination parameters of the conjunction of two special graphs. Discussiones Mathematicae Graph Theory, Tome 21 (2001) pp. 303-310. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1152/
[000] [1] R. Diestel, Graph Theory (Springer-Verlag, New York, Inc., 1997).
[001] [2] S. Gravier and A. Khelladi, On the domination number of cross products of graphs, Discrete Math. 145 (1995) 273-277, doi: 10.1016/0012-365X(95)00091-A. | Zbl 0833.05053
[002] [3] M.S. Jacobson and L.F. Kinch, On the domination number of products of graphs: I, Ars Combin. 18 (1983) 33-44. | Zbl 0566.05050
[003] [4] V.R. Kulli and B. Janakiram, The split domination number of a graph, Graph Theory Notes of New York XXXII (1997) 16-19.
[004] [5] E. Sampathkumar and H.B. Walikar, The connected domination number of graph, J. Math. Phy. Sci. 13 (1979) 607-613. | Zbl 0449.05057