Edge-Fault-Tolerant Pancyclicity of Alternating Group Graphs

被引：6
|
作者：
Tsai, Ping-Ying [1 ]
Chen, Gen-Huey [1 ]
Fu, Jung-Sheng [2 ]
机构：
[1] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan
[2] Natl United Univ, Dept Elect Engn, Miaoli, Taiwan
来源：
NETWORKS | 2009年 / 53卷 / 03期
关键词：
alternating group graph; Cayley graph; cycle embedding; fault tolerance; pancycle; INTERCONNECTION NETWORKS; HAMILTONIAN-CONNECTIVITY; AUGMENTED CUBES; STAR GRAPHS; N-CUBES; PANCONNECTIVITY; CYCLES;
D O I：
10.1002/net.20291
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 2n - 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. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 53(3), 307-313 2009
引用
收藏
页码：307 / 313
页数：7
相关论文
共 50 条
12345