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
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· Theory of Computing Systems· 0 citations
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.