8 citations · 11 across the 4 of their papers we have counts for
4 papers
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 and , every connected -regular graph of order , other than …
Generalized power domination in claw-free regular graphs
Hangdi Chen, Changhong Lu, Qingjie Ye
In this paper, we give a series of couterexamples to negate a conjecture and hence answer an open question on the -power domination of regular graphs (see [P. Dorbec et al., SIA…
A Note on Roman \{2\}-domination problem in graphs
Hangdi Chen, Changhong Lu
For a graph , a Roman -dominating function (R2DF) has the property that for every vertex with , either there exists a nei…
Approximation Algorithms for the Capacitated Domination Problem
Mong-Jen Kao, Han-Lin Chen
We consider the {\em Capacitated Domination} problem, which models a service-requirement assignment scenario and is also a generalization of the well-known {\em Dominating Set} pro…