Redirigiendo al acceso original de articulo en 22 segundos...
Inicio  /  Information  /  Vol: 10 Par: 1 (2019)  /  Artículo
ARTÍCULO
TITULO

The g-Good-Neighbor Diagnosability of Bubble-Sort Graphs under Preparata, Metze, and Chien?s (PMC) Model and Maeng and Malek?s (MM)* Model

Shiying Wang and Zhenhua Wang    

Resumen

Diagnosability of a multiprocessor system is an important topic of study. A measure for fault diagnosis of the system restrains that every fault-free node has at least g fault-free neighbor vertices, which is called the g-good-neighbor diagnosability of the system. As a famous topology structure of interconnection networks, the n-dimensional bubble-sort graph ???? B n has many good properties. In this paper, we prove that (1) the 1-good-neighbor diagnosability of ???? B n is 2??-3 2 n - 3 under Preparata, Metze, and Chien?s (PMC) model for ??=4 n = 4 and Maeng and Malek?s (MM)* * model for ??=5 n = 5 ; (2) the 2-good-neighbor diagnosability of ???? B n is 4??-9 4 n - 9 under the PMC model and the MM* * model for ??=4 n = 4 ; (3) the 3-good-neighbor diagnosability of ???? B n is 8??-25 8 n - 25 under the PMC model and the MM* * model for ??=7 n = 7 .

 Artículos similares