Generalized power domination in claw-free regular graphs

Abstract

In this paper, we first show that if k ≥ 2, the k-power domination number of a connected claw-free (k + 3)-regular graph on n vertices is at most n k+4 , and this bound is tight. The statement partly prove the conjecture presented by Dorbec et al.