Skip to content

Author

Chang-Hong Lu

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Tight bounds for generalized power domination in regular graphs

Dorbec et al. [SIAM J. Discrete Math., 27 (2013)] conjectured that, for all integers $k\geq1$ and $r\geq3$, every connected $r$-regular graph $G$ of order $n$, other than $K_{r,r}$, satisfies $\gamma_{P,k}(G)\leq n/(r+1)$. After disproving this conjecture, Chen et al.[Graphs Combin., 38 (2022)] proposed a corresponding...

Hang Chen, Chang-Hong Lu, Qing-Jie Ye · 0 citations
Sep 2026

Fast Algorithms for a Large-Scale File Aggregation Problem

Results show that OnGP provides a robust online solution with efficiencies close to the Best Fit algorithm, while OffGP matches the near-optimal performance of Best Fit Decreasing within a 1.036% margin, confirming their value for time-critical applications.

Li-Feng Guo, Chang-Hong Lu, Qing-Jie Ye · 0 citations
Preprint Sep 2026

Paired Domination in Cubic Bipartite Graphs

A paired dominating set of a graph $G$ is a dominating set $D$ such that $G[D]$ has a perfect matching. The minimum size of such a set is the paired domination number $\gpr(G)$. Desormeaux and Henning conjectured that every cubic bipartite graph $G$ of order $n$ satisfies $\gpr(G)\le n/2$. We prove the conjecture in th...

Chang-Hong Lu, Qi Wu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.