6 citations · 15 across the 15 of their papers we have counts for
15 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 …
A stability theorem for multi-partite graphs
Wanfang Chen, Changhong Lu, Long-Tu Yuan
The Erdős-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erdős-Simonovits type stability theorem in multi-partite graph…
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
Changhong Lu, Qingjie Ye
In this paper, we consider the minimal doubly resolving set problem in Hamming graphs, hypercubes and folded hypercubes. We prove that the minimal doubly resolving set problem in h…
The Paired Domination Number of Cubic Graphs
Bin Sheng, Changhong Lu
Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domina…
Independent Double Roman Domination on Block Graphs
Decheng Wei, Changhong Lu
Given a graph , is the Italian dominating function of if satisfies when . Denote $w(f)=\sum_{v…
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…