Abstract
The power domination problem aims to find the minimum number of phase measurement units (PMUs) required in order to observe the entire electric power system. Zhao and Kang [6] remarked that there is no known nonplanar graph of diameter two with a power domination number that is arbitrarily large. In this note, we show that the power domination number of such graphs can be arbitrarily large.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have