Edge-fault-tolerant pancyclicity of alternating group graphs.
Journal
Networks
Journal Volume
53
Journal Issue
3
Pages
307-313
Date Issued
2009
Author(s)
Abstract
Abstract 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
Type
journal article