The $d$-distance $p$-packing domination number: complexity, cycles, and trees

Abstract

A set of vertices $X\subseteq V(G)$ is a $d$-distance dominating set if for every $u\in V(G)\setminus X$ there exists $x\in X$ such that $d(u,x) \le d$, and $X$ is a $p$-packing if $d(u,v) \ge p+1$ for every different $u,v\in X$. The $d$-distance $p$-packing domination number $γ_d^p(G)$ of $G$ is the minimum size of a set of vertices of $G$ which is both a $d$-distance dominating set and a $p$-packing. It is proved that for every two fixed integers $d$ and $p$ with $2 \le d$ and $0 \le p \leq 2d-1$, the decision problem whether $γ_d^p(G) \leq k$ holds is NP-complete for bipartite planar graphs. A necessary and sufficient condition for the existence of a $d$-distance $p$-packing dominating set in $C_n$ is obtained and $γ_d^p(C_n)$ determined for every $d$, $p$, and $n$. For a tree $T$ on $n$ vertices with $\ell$ leaves and $s$ support vertices it is proved that (i) $γ_2^0(T) \geq \frac{n-\ell-s+4}{5}$, (ii) $\left \lceil \frac{n-\ell-s+4}{5} \right \rceil \leq γ_2^2(T) \leq \left \lfloor \frac{n+3s-1}{5} \right \rfloor$, and if $d \geq 2$, then (iii) $γ_d^2(T) \leq \frac{n-2\sqrt{n}+d+1}{d}$. Inequality (i) improves an earlier bound due to Meierling and Volkmann, and independently Raczek, Lemańska, and Cyman, while (iii) extends an earlier result for $γ_2^2(T)$ due to Henning. Sharpness of the bounds are discussed and established in most cases. It is also proved that every connected graph $G$ contains a spanning tree $T$ such that $γ_2^2(T) \leq γ_2^2(G)$.