Domination number of modular product graphs

Given two graphs G and H, their modular product G H is defined to be the graph with V(G H) = V(G) x V( H) and E( G H) = E(GH). E(G x H). E(G x H). A dominating set of G is any set D. V(G) such that every vertex of G not contained in D has a neighbor in D. A total dominating set of G is a dominating set D of G with the additional property that all vertices of D also have a neighbor in D. The domination number. (G) (resp. total domination number.t (G)) of G is the cardinality of a smallest dominating set (resp. total dominating set) of G. In this work we give several upper and lower bounds for. (G H) in terms of. (G),. ( H),.t (G) and.t (H), where G is the complement graph of G. Further, we fully describe graphs where. (G H) = k for k. {1, 2, 3}. Several conditions on G and H under which. (G H) is at most 4 and 5 are also given. A new type of simultaneous domination.(G), defined as the smallest number of vertices that dominates G and totally dominates the complement of G, emerged as useful and we believe it could be of independent interest. We conclude the paper by proposing few directions for possible further research.