Hybrid fault diagnosis capability analysis of highly connected graphs
Abstract
Zhu et al. [Theoret. Comput. Sci. 758 (2019) 1--8] introduced the -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 -edge tolerable diagnosabilities of these networks are unknown, which is our motivation for research. In this paper, we obtain the lower bound of the -edge tolerable diagnosability of a -connected graph and establish the -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].
Keywords
Cite
@article{arxiv.2007.03455,
title = {Hybrid fault diagnosis capability analysis of highly connected graphs},
author = {Yulong Wei and Rong-hua Li and Weihua Yang},
journal= {arXiv preprint arXiv:2007.03455},
year = {2020}
}
Comments
20 pages, 6 figures. arXiv admin note: text overlap with arXiv:1904.07020