The power domination problem seeks to find the placement of the minimum number of sensors needed to monitor an electric power network. We generalize the power domination problem to hypergraphs using the infection rule from Bergen et al. (2018): given an initial set of observed vertices, S-0, a set A subset of S-0 may infect an edge e if A subset of e and for any unobserved vertex v, if A boolean OR {v} is contained in an edge, then v is an element of e. We combine a domination step with this infection rule to create infectious power domination. We compare this new parameter to the previous generalization by Chang and Roussel (2015). We provide general bounds and determine the impact of some hypergraph operations. (C) 2019 Elsevier B.V. All rights reserved.
展开▼
