River Zhang

A counterexample to packing-domination inheritance in strong products

The d-distance p-packing domination number of a graph is the minimum size of a set that dominates within distance d and separates distinct centers by distance at least p+1, with value infinity when no such set exists. Bujtás, Iršič Chenoweth, Klavžar and Zhang conjectured that no...