Tight bounds for generalized power domination in regular graphs

Hangdi Chen, Changhong Lu, Qingjie Ye

Dorbec et al. [SIAM J. Discrete Math., 27 (2013)] conjectured that, for all integers $k\ge 1$ and $r\ge 3$, every connected $r$-regular graph $G$ of order $n$, other than $K_{r,r}$…