Power domination in cubic graphs and Cartesian products

Abstract

The power domination problem focuses on finding the optimal placement of phase measurement units (PMUs) to monitor an electrical power network. In the context of graphs, the power domination number of a graph G, denoted γP(G), is the minimum number of vertices needed to observe every vertex in the graph according to a specific set of observation rules. In [15], Zhao et al. proved that if G is a connected claw-free cubic graph of order n, then γP(G)≤n/4. In this paper, we show that if G is a claw-free diamond-free cubic graph of order n, then γP(G)≤n/6, and this bound is sharp. We also provide new bounds on γP(G□H) where G□H is the Cartesian product of graphs G and H. In the specific case that G and H are trees whose power domination number and domination number are equal, we show the Vizing-like inequality holds and γP(G□H)≥γP(G)γP(H).