Connected power domination number of product graphs

In this paper, we consider the connected power domination number ([Formula: see text]) of three standard products of graphs. The exact value of the connected power domination number of [Formula: see text] is obtained for any two nontrivial graphs [Formula: see text] and [Formula: see text] Further, tight upper bounds are proved for the connected power domination number of the Cartesian product of two graphs [Formula: see text] and [Formula: see text] Consequently, the exact value of the connected power domination number of the Cartesian product of some standard graphs is determined. Finally, the connected power domination number of the tensor product of graphs is discussed.