Conditional Diagnosability of Alternating Group Graphs
Rong‐Xia Hao, Yan‐Quan Feng, Jin‐Xin Zhou · IEEE Transactions on Computers · 2012
Let An be the alternating group of degree n with n ≥ 3. Set S = {(1 2 i), (1 i 2)| 3 ≤ i ≤ n}. The alternating group graph, denoted by AGn, is defined as the Cayley graph on An with respect to S. Jwo et al. [Networks 23 (1993) 315-326] introduced alternating group graph AGnas an interconnection network topology for computing systems. Conditional diagnosability, a new measure of diagnosability introduced by Lai et al. [IEEE Transactions on Computers 54(2) (2005) 165-175] can better measure the diagnosability of regular interconnection networks. This paper determines that under PMC-model the conditional diagnosability of AGnis 4 for n = 4 and 6n -18 for each n ≥ 5.