Beschreibung:
<jats:p>We review recent results on the power domination problem of graph products and establish improved results for some families of graph products, namely, , , Pn ⊠ Pm, Pn ⊠ Cm and Cn ⊠ Cm. We also characterize graphs G and H for which the power domination number of the Cartesian product of G and H, which is denoted as , is 1.
</jats:p>