Premium
Edge‐fault‐tolerant pancyclicity of alternating group graphs
Author(s) -
Tsai PingYing,
Chen GenHuey,
Fu JungSheng
Publication year - 2009
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20291
Subject(s) - combinatorics , graph , cayley graph , vertex transitive graph , enhanced data rates for gsm evolution , pancyclic graph , discrete mathematics , computer science , mathematics , voltage graph , line graph , pathwidth , telecommunications
The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. Previously, the alternating group graph was shown to be pancyclic, i.e., containing cycles of all possible lengths. In this article, we further show that the alternating group graph remains pancyclic, even if there are up to 2 n − 6 edge faults, where n ≥ 3 is the dimension of the alternating group graph. The result is optimal with respect to the number of edge faults tolerated. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009