Answers are grounded in this paper and cite their sources.
The dependability of multiprocessor systems is essential for facilitating large-scale computing, and the self-diagnosability of the system is the core indicator of its reliability. The cyclic diagnosability of graph G, represented as ct(G), is characterized as the largest size of one faulty vertex set R, provided that after removing R, the remaining graph G−R becomes disconnected and includes no less than two cycles, with each cycle located in a separate connected component. The modified bubble-sort graph is an enhanced variant of the standard bubble-sort graph with a cyclic symmetric structure, which grants its superior topological properties for interconnection networks. In this article, we determine the cyclic diagnosability of the n-dimensional modified bubble-sort graph MBn under the Preparata/Metze/Chien model (PMC-M) and the Maeng/Malek* model (MM*-M) as ct(MBn)=5n−10 for n⩾11.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: