论文标题
高度连接图的混合故障诊断能力分析
Hybrid fault diagnosis capability analysis of highly connected graphs
论文作者
论文摘要
朱等。 [理论。计算。科学。 758（2019）1--8]引入了$ h $ - 边缘可容忍的诊断性，以衡量具有错误链接的多处理器系统的故障诊断能力。这种诊断性是对传统诊断性概念的概括。如果其最小度等于其顶点连接，则将图称为最大连接图。众所周知，许多不规则的网络都是最大连接的图形，这些网络的$ H $ edge可耐受性诊断性是未知的，这是我们的研究动机。在本文中，我们获得了$ h $ - 边缘可耐受性的可诊断性的下限，并在PMC模型和MM $^*$模型下建立了最大连接图的$ H $ - 边缘可耐受性的可诊断性，从而扩展了[IEEE Trans的一些结果。计算。 23（1974）86--88]，[IEEE Trans。计算。 53（2004）1582--1590]和[定理。计算。科学。 796（2019）147--153]。
Zhu et al. [Theoret. Comput. Sci. 758 (2019) 1--8] introduced the $h$-edge tolerable diagnosability to measure the fault diagnosis capability of a multiprocessor system with faulty links. This kind of diagnosability is a generalization of the concept of traditional diagnosability. A graph is called a maximally connected graph if its minimum degree equals its vertex connectivity. It is well-known that many irregular networks are maximally connected graphs and the $h$-edge tolerable diagnosabilities of these networks are unknown, which is our motivation for research. In this paper, we obtain the lower bound of the $h$-edge tolerable diagnosability of a $t$-connected graph and establish the $h$-edge tolerable diagnosability of a maximally connected graph under the PMC model and the MM$^*$ model, which extends some results in [IEEE Trans. Comput. 23 (1974) 86--88], [IEEE Trans. Comput. 53 (2004) 1582--1590] and [Theoret. Comput. Sci. 796 (2019) 147--153].
