A result on Vizingʹs conjecture

Let γ(G) denote the domination number of a simple graph G and let G□H denote the Cartesian product of two simple graphs G and H. In this paper we prove that if γ(G)=3, then γ(G□H)≥γ(G)γ(H).