Approximations for Fault-Tolerant Total and Partial Positive Influence Domination

Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis +1

In $\text{total domination}$, given a graph $G=(V,E)$, we seek a minimum-size set of nodes $S\subseteq V$, such that every node in $V$ has at least one neighbor in $S$. We define…