Linear kernels for k-tuple and liar's domination in bounded genus graphs

Arijit Bishnu, Arijit Ghosh, Subhabrata Paul

A set $D\subseteq V$ is called a $k$-tuple dominating set of a graph $G=(V,E)$ if $\left|N_G[v]\cap D\right|\ge k$ for all $v\in V$, where $N_G[v]$ denotes the closed neighbo…