Introduction to Robust Power Domination

arXiv2305.13430MaRDI QIDQ6437553FDOQ6437553

Authors: Beth Bjorkman, Esther Conrad 

Publication date: 22 May 2023

Abstract: Sensors called phasor measurement units (PMUs) are used to monitor the electric power network. The power domination problem seeks to minimize the number of PMUs needed to monitor the network. We extend the power domination problem and consider the minimum number of sensors and appropriate placement to ensure monitoring when $k$ sensors are allowed to fail with multiple sensors allowed to be placed in one location. That is, what is the minimum multiset of the vertices, $S$, such that for every $FsubseteqS$ with $|F|=k$, $SsetminusF$ is a power dominating set. Such a set of PMUs is called a $k$-robust power domination set. This paper generalizes the work done by Pai, Chang and Wang in 2010 on vertex-fault-tolerant power domination, which did not allow for multiple sensors to be placed at the same vertex. We provide general bounds and determine the $k$-robust power domination number of some graph families.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

This page was built for publication: Introduction to Robust Power Domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437553)