The $d$-distance $p$-packing domination number: complexity, cycles, and treesBujtás, Csilla (Avtor) Iršič Chenoweth, Vesna (Avtor) Klavžar, Sandi (Avtor) Zhang, Gang (Avtor) d-distance dominating setp-packing setdominating settreesplanar graphsA 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 $\gamma_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 $\gamma_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 $\gamma_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) $\gamma_2^0(T) \geq \frac{n-\ell-s+4}{5}$, (ii) $\left \lceil \frac{n-\ell-s+4}{5} \right \rceil \leq \gamma_2^2(T) \leq \left \lfloor \frac{n+3s-1}{5} \right \rfloor$, and if $d \geq 2$, then (iii) $\gamma_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\'nska, and Cyman, while (iii) extends an earlier result for $\gamma_2^2(T)$ due to Henning. Sharpness of the bounds is discussed and established in most cases. It is also proved that every connected graph $G$ contains a spanning tree $T$ such that $\gamma_2^2(T) \leq \gamma_2^2(G)$.20262026-02-23 09:38:38Neznano27714UDK: 519.17ISSN pri članku: 0001-9054DOI: 10.1007/s00010-026-01266-wCOBISS_ID: 269190659sl