Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model

2015 ◽  
Vol 20 (2) ◽  
pp. 1-16 ◽  
Author(s):  
Naiwen Chang ◽  
Eddie Cheng ◽  
Sunyuan Hsieh
Keyword(s):  
Cayley Graphs ◽  
Pmc Model ◽  
Conditional Diagnosability

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

Conditional Diagnosability of Burnt Pancake Networks Under the PMC Model

2015 ◽  
pp. bxv066 ◽  
Author(s):  
Sulin Song ◽  
Shuming Zhou ◽  
Xiaoyan Li
Keyword(s):  
Pmc Model ◽  
Conditional Diagnosability

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