A Survey for Conditional Diagnosability of Alternating Group Networks

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

Download Full-text

Conditional Diagnosability of Alternating Group Networks Under the PMC Model

IEEE/ACM Transactions on Networking ◽

10.1109/tnet.2020.3002093 ◽

2020 ◽

Vol 28 (5) ◽

pp. 1968-1980

Author(s):

Nai-Wen Chang ◽

Sun-Yuan Hsieh

Keyword(s):

Alternating Group ◽

Pmc Model ◽

Conditional Diagnosability

Download Full-text

Conditional diagnosability of alternating group networks

Information Processing Letters ◽

10.1016/j.ipl.2010.03.010 ◽

2010 ◽

Vol 110 (10) ◽

pp. 403-409 ◽

Cited By ~ 33

Author(s):

Shuming Zhou ◽

Wenjun Xiao

Keyword(s):

Alternating Group ◽

Conditional Diagnosability

Download Full-text

Conditional Diagnosability of Alternating Group Graphs

IEEE Transactions on Computers ◽

10.1109/tc.2012.15 ◽

2013 ◽

Vol 62 (4) ◽

pp. 827-831 ◽

Cited By ~ 36

Author(s):

Rong-Xia Hao ◽

Yan-Quan Feng ◽

Jin-Xin Zhou

Keyword(s):

Alternating Group ◽

Conditional Diagnosability

Download Full-text

A UNIFIED APPROACH TO THE CONDITIONAL DIAGNOSABILITY OF INTERCONNECTION NETWORKS

Journal of Interconnection Networks ◽

10.1142/s0219265912500077 ◽

2012 ◽

Vol 13 (03n04) ◽

pp. 1250007 ◽

Cited By ~ 13

Author(s):

EDDIE CHENG ◽

LÁSZLÓ LIPTÁK ◽

KE QIU ◽

ZHIZHANG SHEN

Keyword(s):

Interconnection Networks ◽

Ad Hoc ◽

Cayley Graphs ◽

Alternating Group ◽

Unified Approach ◽

Star Graphs ◽

Conditional Diagnosability

The conditional diagnosability of interconnection networks has been studied in a number of ad-hoc methods resulting in various conditional diagnosability results. In this paper, we utilize these existing results to give an unified approach in studying this problem. Following this approach, we derive the exact value of the conditional diagnosability for a number of interconnection networks including Cayley graphs generated by 2-trees (which generalize alternating group graphs), arrangement graphs (which generalize star graphs and alternating group graphs), hyper Petersen networks, and dual-cube like networks (which generalize dual-cubes.)

Download Full-text