Vesna Iršič Chenoweth

collaborators

2 papers

math.CO2025

On $d$ -distance $p$ -packing domination number in strong products

Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar +1

The $d$ -distance $p$ -packing domination number $γ_{d}^{p} (G)$ of a graph $G$ is the cardinality of a smallest set of vertices of $G$ which is both a $d$ -distance dominating set and a $…

math.CO2025

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

Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar +1

A set of vertices $X \subseteq V (G)$ is a $d$ -distance dominating set if for every $u \in V (G) ∖ X$ there exists $x \in X$ such that $d (u, x) \leq d$ , and $X$ is a $p$ -packing if…

On d-distance p-packing domination number in strong products

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

On $d$ -distance $p$ -packing domination number in strong products

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