Secure Total Domination Number in Maximal Outerplanar Graphs

Yasufumi Aita, Toru Araki

A subset $S$ of vertices in a graph $G$ is a secure total dominating set of $G$ if $S$ is a total dominating set of $G$ and, for each vertex $u\notin S$, there is a vertex $v \in…