  In this paper, we consider the connected power domination number ($\gamma_{P,
c}$) of three standard graph products. The exact value for $\gamma_{P,
c}(G\circ H)$ is obtained for any two non-trivial graphs $G$ and $H.$ Further,
tight upper bounds are proved for the connected power domination number of the
Cartesian product of two graphs $G$ and $H.$ 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 tensor
product of graphs is discussed.
