Power domination of the cartesian product of graphs

In this paper, we first give a brief survey on the power domination of the Cartesian product of graphs. Then we conjecture a Vizing-like inequality for the power domination problem, and prove that the inequality holds when at least one of the two graphs is a tree.