Revisiting $d$-distance (independent) domination in trees and in bipartite graphs

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

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. In 1…