The study of domination in Cartesian products has received its main motivation from attempts to settle a conjecture made by V.G. Vizing in 1968. He conjectured that γ(G)γ(H) is a lower bound for the domination number of the Cartesian product of any two graphs G and H. Most of the progress on settling this conjecture has been limited to verifying the conjectured lower bound if one of the graphs has a certain structural property. In addition, a number of authors have established bounds for dominating the Cartesian product of any two graphs. We show how it is possible to improve some of these bounds by imposing conditions on both graphs. For example, we establish a new lower bound for the domination number of T T, when T is a tree, and we improve an upper bound of Vizing in the case when one of the graphs has k > 1 dominating sets which cover the vertex set and the other has a dominating set which partitions in a certain way.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1201,
author = {Bert L. Hartnell and Douglas F. Rall},
title = {Improving some bounds for dominating Cartesian products},
journal = {Discussiones Mathematicae Graph Theory},
volume = {23},
year = {2003},
pages = {261-272},
zbl = {1055.05115},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1201}
}
Bert L. Hartnell; Douglas F. Rall. Improving some bounds for dominating Cartesian products. Discussiones Mathematicae Graph Theory, Tome 23 (2003) pp. 261-272. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1201/
[000] [1] A.M. Barcalkin and L.F. German, The external stability number of the Cartesian product of graphs, Bul. Akad. Stiince RSS Moldoven. 1 (1979) 5-8.
[001] [2] W.E. Clark and S. Suen, An inequality related to Vizing's conjecture, Elec. J. Combin. 7 (#N4) (2000) 1-3. | Zbl 0947.05056
[002] [3] M. El-Zahar and C.M. Pareek, Domination number of products of graphs, Ars Combin. 31 (1991) 223-227. | Zbl 0746.05067
[003] [4] B.L. Hartnell, On determining the 2-packing and domination numbers of the Cartesian product of certain graphs, Ars Combin. 55 (2000) 25-31. | Zbl 0994.05102
[004] [5] B.L. Hartnell and D.F. Rall, On Vizing's conjecture, Congr. Numer. 82 (1991) 87-96. | Zbl 0764.05092
[005] [6] B.L. Hartnell and D.F. Rall, Chapter 7: Domination in Cartesian products: Vizing's conjecture, in: T.W. Haynes, S.T. Hedetniemi and P.J. Slater, eds, Domination in Graphs: Advanced Topics, Monographs and Textbooks in Pure and Applied Mathematics, Vol. 209 (Marcel Dekker, Inc., New York, 1998). | Zbl 0890.05035
[006] [7] B.L. Hartnell and D.F. Rall, Lower bounds for dominating Cartesian products, J. Combin. Math. Combin. Comp. 31 (1999) 219-226. | Zbl 0938.05048
[007] [8] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Monographs and Textbooks in Pure and Applied Mathematics, Vol. 208 (Marcel Dekker, Inc., New York, 1998). | Zbl 0890.05002
[008] [9] J.F. Fink, M.S. Jacobson, L.F. Kinch and J. Roberts, On graphs having domination number half their order, Period. Math. Hungar. 16 (1985) 287-293, doi: 10.1007/BF01848079. | Zbl 0602.05043
[009] [10] 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
[010] [11] M.S. Jacobson and L.F. Kinch, On the domination of the products of graphs II: trees, J. Graph Theory 10 (1986) 97-106, doi: 10.1002/jgt.3190100112. | Zbl 0584.05053
[011] [12] V.G. Vizing, The Cartesian product of graphs, Vy cisl. Sistemy 9 (1963) 30-43.
[012] [13] V.G. Vizing, Some unsolved problems in graph theory, Uspehi Mat. Nauk 23 (6) (1968) 117-134. | Zbl 0177.52301