Graph products and integer domination

Abstract

We consider the κkκ-domination number γκ kκ(G) of a graph G and the Cartesian product G□H and the strong direct product Gsquared timesH of graphs G and H. We prove that for integers k,m<1, γκ kκ(Gsquared timesH)