Edge‐fault‐tolerant pancyclicity of alternating group graphs
Copyright policy )Edge‐fault‐tolerant pancyclicity of alternating group graphs
AbstractThe 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. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009
- National United University Taiwan
- National Taiwan University of Arts Taiwan
pancycle, cycle embedding, alternating group graph, fault tolerance, Paths and cycles, Cayley graph, Graphs and abstract algebra (groups, rings, fields, etc.)
pancycle, cycle embedding, alternating group graph, fault tolerance, Paths and cycles, Cayley graph, Graphs and abstract algebra (groups, rings, fields, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!