A linear-time algorithm for semitotal domination in strongly chordal graphs

Vikash Tripathi, Arti Pandey, Anil Maheshwari

In a graph $G=(V,E)$ with no isolated vertex, a dominating set $D\subseteq V$, is called a semitotal dominating set if for every vertex $u\in D$ there is another vertex $v\in D$…