Power domination in graphs

Paul Dorbec (1, 2)

1 Equipe AMACC - Laboratoire GREYC - UMR6072
2 GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen

In this chapter, we are interested in power domination in graphs. Power domination is a variation of domination introduced to address a physical problem of monitoring a network with phasor measurement units. The originality of this variation is that some propagation happens, and the set of covered vertices results from an iterative process. We present a survey of known results on this specific parameter.

Keywords: power domination; zero forcing set; propagation; phasor measurement unit placement

Domains: Discrete Mathematics [cs.DM]; Combinatorics [math.CO]

Paul Dorbec. Power domination in graphs. Topics in Domination in Graphs, 2020, 978-3-030-51117-3. ⟨10.1007/978-3-030-51117-3_16⟩. ⟨hal-03073783⟩