International Journal of Mathematics Trends and Technology
Volume 45 | Number 1 | Year 2017 | Article Id. IJMTT-V45P504 | DOI : https://doi.org/10.14445/22315373/IJMTT-V45P504
A dominating set D for a graph G is a subset of V(G) such that any vertex not in D has at least one neighbor in D. The domination number γ(G) is the size of a minimum dominating set in G. Vizing‟s conjecture from 1968 states that for the Cartesian product of graphs G and H ,γ(G)γ(H) ≤ γ(G□H), and Clark and Suen (2000) proved that γ(G)γ(H)≤2γ(G□H). In this paper, we modify the approach of Clark and Suen to prove a variety of similar bounds related to total and paired domination, and also extend these bounds to then n-Cartesian product of graphs A1throughAn.
[1] B.Stjan, B.Brešar, P.Dorbec, W.Goddard, B.Hartnell, M.Henning, S.Klavžar, and D.Rall. Vizing‟s conjecture: A survey and recent results, 2009.
[2] W.Clark and S.Suen. An inequality realated to Vizing‟s conjecture. Electronic journal of combinatorics, 7(Note 4), 2000.
[3] P.T.Ho. A note on the total domination number. Utilitas Mathematica, 77:97-100, 2008.
[4] X.M.Hou and F.Jiang. Paired domination of Cartesian products of graphs, Journal of Mathematical Research and Exposition, 30(1): 181-185, 2010.
[5] B.Brešar, M.Henning, D.Rall. Paired-domination of Cartesian products of graphs[J]. Util. Math., 2007, 73: 255-265.
[6] Cockayne E J, Dawes R M, Hedetniemi S T. Total domination in graphs[J]. Networks, 1980. 10(3): 211-219.
[7] J.A. Pondy and U.S.R. Murthy. Graph theory with Applications., chapter-I to V.
[8] Bert Hartnell and Douglas F. Rall, Domination in Cartesian Products: Vizing‟s Conjecture, in Domination in Graphs-Advanced Topics edited by Haynes, et al, Marcel Dekker, Inc, New York, 1998, 163-189.
[9] V.G. Vizing, The Cartesian Product of Graphs, Vycisal, Sistemy 9,1963, 30-43.
[10] HOU Xinmin. Total domination of Cartesian products of graphs [J]. Discuss, Math,Graph theory, 2007, 27(1): 175-178.
[11] HAYNES T W, SLATER P.J. Paired domination in Graphs [J], Networks, 1998, 32(3): 199-206.
[12] NOWAKOWSKI R J, RALL D F. Associative graph products and their independence, domination and colouring numbers [J]. Discuss. Math. Graph theory, 1996, 16(1): 53-79.
[13] VIZING V.G. Some unsolved problems in graph theory [J]. Uspehi Mat. Nauk, 1968, 6(144): 117-134. (in Russian).
[14] PELEG D, ULLMAN J D. An optimal synchronizer for the hypercube [J]. SIAM J. comput., 1989, 18(4): 740-747.
[15] Domination in Graph with its Applications, PREETI GUPTA, Prestige institute of Engineering and Science, Indore.
S.Divya, "A Review on Total and Paired Domination of Cartesian product Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 45, no. 1, pp. 22-27, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V45P504
PDF 
Abstract 
Keywords 
References 
Citation