Abstract
The product power throttling number of a graph is defined to study prod-uct throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number. It is estab-lished that the two parameters are equal for certain families including paths, cycles, complete graphs, unit interval graphs, and grid graphs (on the plane, cylinder, and torus). Families of graphs for which the prod-uct power throttling number is less than the domination number are also exhibited. Graphs with extremely high or low product power throttling number are characterized and bounds on the product power throttling number are established.