arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.03455math.CO
收藏

高连通图的混合故障诊断能力分析

Hybrid fault diagnosis capability analysis of highly connected graphs

Yulong Wei, Rong-hua Li, Weihua Yang

摘要:

Zhu等[Theoret. Comput. Sci. 758(2019)1--8]引入了$h$边缘可容忍诊断性,以测量具有故障链路的多处理器系统的故障诊断能力。这种可诊断性是对传统可诊断性概念的推广。一个图称为最大连通图,如果它的最小度等于它的顶点连通度。众所周知,许多不规则网络是最大连通图,而这些网络的$h$ -边容许可诊断性是未知的,这是我们研究的动机。本文得到了$t$ -连通图的$h$ -边容许可诊断性的下界,并在PMC模型和MM $^*$模型下建立了极大连通图的$h$ -边容许可诊断性,推广了[IEEE Trans. Comput. 23(1974)86- 88]、[IEEE Trans. Comput. 53(2004)1582- 1590]和[TheoreticComput. Sci. 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].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑