Issue No.04 - April (2013 vol.62)

pp: 827-831

Rong-Xia Hao , Dept. of Math., Beijing Jiaotong Univ., Beijing, China

Yan-Quan Feng , Dept. of Math., Beijing Jiaotong Univ., Beijing, China

Jin-Xin Zhou , Dept. of Math., Beijing Jiaotong Univ., Beijing, China

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2012.15

ABSTRACT

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 AG

_{n}as 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 AG_{n}is 4 for n = 4 and 6n -18 for each n ≥ 5.INDEX TERMS

network topology, graph theory, group theory, multiprocessor interconnection networks, regular interconnection networks diagnosis, conditional diagnosability, group graphs, Cayley graph, interconnection network topology, PMC-model, Program processors, Multiprocessing systems, Joining processes, Hypercubes, Fault diagnosis, Periodic structures, alternating group graph, Comparison diagnosis, conditional diaganosability

CITATION

Rong-Xia Hao, Yan-Quan Feng, Jin-Xin Zhou, "Conditional Diagnosability of Alternating Group Graphs",

*IEEE Transactions on Computers*, vol.62, no. 4, pp. 827-831, April 2013, doi:10.1109/TC.2012.15REFERENCES