Proof of a conjecture on kk-tuple domination in graphs

Let G=(V,E)G=(V,E) be a graph and NG[v]NG[v] the closed neighborhood of a vertex vv in GG. For k∈Nk∈N, the minimum cardinality of a set D⊆VD⊆V with |NG[v]∩D|≥k