scholarly journals The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM⁎ model

2016 ◽  
Vol 628 ◽  
pp. 92-100 ◽  
Author(s):  
Mujiangshan Wang ◽  
Yuqing Lin ◽  
Shiying Wang
Keyword(s):  
Cayley Graphs ◽  
Pmc Model ◽  
Good Neighbor

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
Keyword(s):  
Star Graph ◽  
Pmc Model ◽  
Conditional Diagnosability ◽  
Star Graph Networks ◽  
Good Neighbor

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

Information ◽  
2019 ◽  
Vol 10 (1) ◽  
pp. 21
Author(s):  
Shiying Wang ◽  
Zhenhua Wang
Keyword(s):  
Fault Diagnosis ◽  
Interconnection Networks ◽  
Multiprocessor System ◽  
Topology Structure ◽  
Free Node ◽  
Pmc Model ◽  
Good Neighbor

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 .

The 1-Good-Neighbor Conditional Diagnosability of Some Regular Graphs

2017 ◽  
Vol 17 (03n04) ◽  
pp. 1741001
Author(s):  
MEI-MEI GU ◽  
RONG-XIA HAO ◽  
AI-MEI YU
Keyword(s):  
Alternating Group ◽  
Regular Graphs ◽  
Connected Graphs ◽  
Free Vertex ◽  
Pmc Model ◽  
Star Networks ◽  
Conditional Diagnosability ◽  
Good Neighbor

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].

Sign in / Sign up

Export Citation Format

Share Document