The g-good-neighbor conditional diagnosability, which specifies at least g fault-free neighbors for each fault-free node, is a very important metric in system-level diagnosis. Recently, the g-good-neighbor conditional diagnosabilities of many networks have been investigated. To enhance the g-good-neighbor conditional diagnosability, the $R_g$-conditional diagnosability, which requires at least g fault-free neighbors for each node, has been proposed by Guo et al. [1] (2020) recently. And they establish the $R_g$-conditional diagnosability of the hypercubes under the PMC model. In this paper, we present some counterexamples for the proof of lower bound on the $R_g$-conditional diagnosability of the hypercubes under the PMC model, which is crucial to the original main result. And we further utilize known results to give a reasonable lower bound for the $R_g$-conditional diagnosability of hypercubes.

的克-良好邻条件可诊断性，其指定至少克为每个无故障节点无故障的邻居，是在系统级诊断非常重要的指标。近来，已经研究了许多网络的g-邻居条件可诊断性。为了增强g邻居的条件可诊断性，${\mathrm{[R}}_G$郭等人提出了有条件的可诊断性，每个节点至少需要g个无故障的邻居。[1]（2020）最近。他们建立了${\mathrm{[R}}_G$PMC模型下超立方体的条件诊断性。在本文中，我们提出了一些反例来证明下界的证明。${\mathrm{[R}}_G$PMC模型下超立方体的条件诊断，这对于原始的主要结果至关重要。并且我们进一步利用已知结果为${\mathrm{[R}}_G$立方体的条件诊断性。