Parameterized complexity of $r$-Hop, $r$-Step, and $r$-Hop Roman Domination

Abstract

The \textsc{Dominating Set} problem is a classical and extensively studied topic in graph theory and theoretical computer science. In this paper, we examine the algorithmic complexity of several well-known exact-distance variants of domination, namely \textsc{$r$-Step Domination}, \textsc{$r$-Hop Domination}, and \textsc{$r$-Hop Roman Domination}. Let $G$ be a graph and let $r \geq 2$ be an integer. A set $S \subseteq V(G)$ is an \emph{$r$-hop dominating set} if every vertex in $V(G)\setminus S$ is at distance exactly $r$ from some vertex of $S$. Similarly, $S$ is an \emph{$r$-step dominating set} if every vertex of $G$ lies at distance exactly $r$ from at least one vertex of $S$. An \emph{$r$-hop Roman dominating function} on $G$ is a function $f \colon V(G)\to\{0,1,2\}$ such that for every vertex $v$ with $f(v)=0$, there exists a vertex $u$ at distance exactly $r$ from $v$ with $f(u)=2$. The \emph{weight} of $f$ is defined as $f(V)=\sum_{v\in V(G)} f(v)$. The \textsc{$r$-Hop Domination} (respectively, \textsc{$r$-Step Domination}) problem asks whether $G$ admits an $r$-hop dominating set (respectively, $r$-step dominating set) of size at most $k$, while the \textsc{$r$-Hop Roman Domination} problem asks whether $G$ admits an $r$-hop Roman dominating function of weight at most $k$. It is known that for every $r\ge 2$, the problems \textsc{$r$-Step Domination}, \textsc{$r$-Hop Domination}, and \textsc{$r$-Hop Roman Domination} are \textsc{NP}-complete. First we prove that for all $r\ge 2$, \textsc{$r$-Hop Roman Domination} is \textsc{W[2]}-complete. Furthermore, for every $r\ge 2$, \textsc{$r$-Step Domination} and \textsc{$r$-Hop Domination} remain \textsc{W[2]}-hard even when restricted to bipartite graphs and chordal graphs. Unless the ETH fails, none of these problems admits an algorithm running in time $2^{o(n+m)}$ on graphs with $n$ vertices and $m$ edges.