g-good-neighbor conditional diagnosability of star graph networks under PMC model and MM* model

2017 ◽  
Vol 12 (5) ◽  
pp. 1221-1234 ◽  
Author(s):  
Shiying Wang ◽  
Zhenhua Wang ◽  
Mujiangshan Wang ◽  
Weiping Han
2017 ◽  
Vol 17 (03n04) ◽  
pp. 1741001
Author(s):  
MEI-MEI GU ◽  
RONG-XIA HAO ◽  
AI-MEI YU

The g-good-neighbor conditional diagnosability is the maximum number of faulty vertices a network can guarantee to identify, under the condition that every fault-free vertex has at least g fault-free neighbors. In this paper, we study the 1-good-neighbor conditional diagnosabilities of some general k-regular k-connected graphs G under the PMC model and the MM* model. The main result [Formula: see text] under some conditions is obtained, where l is the maximum number of common neighbors between any two adjacent vertices in G. Moreover, the following results are derived: [Formula: see text] for the hierarchical star networks, [Formula: see text] for the BC networks, [Formula: see text] for the alternating group graphs [Formula: see text].


2012 ◽  
Vol 218 (21) ◽  
pp. 10406-10412 ◽  
Author(s):  
Shao-Lun Peng ◽  
Cheng-Kuan Lin ◽  
Jimmy J.M. Tan ◽  
Lih-Hsing Hsu

2016 ◽  
Vol 16 (02) ◽  
pp. 1650001 ◽  
Author(s):  
MEI-MEI GU ◽  
RONG-XIA HAO ◽  
DOND-XUE YANG

Let tc(G) and tg(G) be the conditional diagnosability and g-good-neighbor diagnosability, respectively, of a graph G. The notion of the g-good-neighbor conditional diagnosability is less restrictive as compared with that of the conditional diagnosability in general. Particularly, the conditional faulty set notion requires that, any vertex, faulty or not, have at least one non-faulty neighbor; while the 1-good-neighbor faulty only requires that a non-faulty vertex have at least one non-faulty neighbor. Compared with conditional diagnosability, g-good-neighbor diagnosability is interesting since it characterizes a stronger tolerance capability. In this paper, we investigate the equal relation between t1(BHn) and tc(BHn) for the balanced hypercubes BHn. That is [Formula: see text] for [Formula: see text] under the PMC model and [Formula: see text] for [Formula: see text] under the MM model; Furthermore, the 2-good-neighbor diagnosability t2(BHn) = 4n − 1 for n ≥ 2 under the PMC model and the MM model is obtained.


Information ◽  
2019 ◽  
Vol 10 (1) ◽  
pp. 21
Author(s):  
Shiying Wang ◽  
Zhenhua Wang

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 n − 3 under Preparata, Metze, and Chien’s (PMC) model for n ≥ 4 and Maeng and Malek’s (MM) ∗ model for n ≥ 5 ; (2) the 2-good-neighbor diagnosability of B n is 4 n − 9 under the PMC model and the MM ∗ model for n ≥ 4 ; (3) the 3-good-neighbor diagnosability of B n is 8 n − 25 under the PMC model and the MM ∗ model for n ≥ 7 .


Sign in / Sign up

Export Citation Format

Share Document