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
机构:
Beijing Normal Univ, Sch Math Sci, Lab Math & Complex Syst, Minist Educ, Beijing 100875, Peoples R China
Xiangtan Univ, Dept Math & Computat Sci, Xiangtan 411105, Hunan, Peoples R ChinaBeijing Normal Univ, Sch Math Sci, Lab Math & Complex Syst, Minist Educ, Beijing 100875, Peoples R China
Li, Pingshan
Xu, Min
论文数: 0引用数: 0
h-index: 0
机构:
Beijing Normal Univ, Sch Math Sci, Lab Math & Complex Syst, Minist Educ, Beijing 100875, Peoples R ChinaBeijing Normal Univ, Sch Math Sci, Lab Math & Complex Syst, Minist Educ, Beijing 100875, Peoples R China