The power domination number of a graph is the minimum number of vertices required to
monitor the graph. Here, the notion of monitoring is given by a set of rules for power
system monitoring where vertices model phasor management units (PMU) in a
power network. We consider the failed power domination number of a graph
,
,
a recently introduced graph parameter. Any set of vertices of
whose cardinality
is greater than
will dominate the graph. The failed power domination number also
allows one to consider PMU (or node) failure. Indeed, any set of
vertices will monitor the network even in the presence of
node
failures. We establish the failed power domination number for products of paths and
cycles including square grids, tori, and hypercubes and provide bounds for the failed
power domination number of square cylinders.
PDF Access Denied
We have not been able to recognize your IP address
44.192.95.161
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.