On the Parameterized Complexity of Semitotal Domination on Graph Classes

TL;DR

This paper investigates the computational complexity of finding minimum semitotal dominating sets in graphs, proving hardness results for certain classes and providing a linear kernel for planar graphs.

Contribution

It establishes W[2]-hardness for bipartite and split graphs and extends kernelization techniques to obtain a linear kernel on planar graphs.

Findings

W[2]-hardness on bipartite and split graphs

Linear kernel of size 358k on planar graphs

Complements existing kernelization results for other dominating set variants

Abstract

For a given graph $G = (V, E)$, a subset of the vertices $D\subseteq V$ is called a semitotal dominating set, if $D$ is a dominating set and every vertex $v \in D$ is within distance two to another witness $v' \in D$. We want to find a semitotal dominating set of minimum cardinality. We show that the problem is $\mathrm{W}[2]$-hard on bipartite and split graphs when parameterized by the solution size $k$. On the positive side, we extend the kernelization technique of Alber, Fellows, and Niedermeier [JACM 2004] to obtain a linear kernel of size $358k$ on planar graphs. This result complements known linear kernels already known for several variants, including Total, Connected, Red-Blue, Efficient, Edge, and Independent Dominating Set.