Conditional Diagnosability of Alternating Group Graphs

Author

Rong-Xia Hao ; Yan-Quan Feng ; Jin-Xin Zhou

Author_Institution

Dept. of Math., Beijing Jiaotong Univ., Beijing, China

Volume

62

Issue

4

fYear

2013

fDate

Apr-13

Firstpage

827

Lastpage

831

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.

Keywords

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

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.2012.15

Filename

6127860