Uni-Directional Alternating Group Graphs
Jung‐Sing Jwo, Tai-Ching Tuan · 1999
A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable. The analysis of the shortest distance between any pair of nodes in a graph of this class is also given. Based on the analysis, we develop a polynomial time routing algorithm which yields a path distance at most one more than the theoretic lower bound. Furthermore, comparisons among uni-directional hypercubes, uni-directional star graphs, and uni-directional alternating group graphs are given. These observations validate the superiority of uni-directional alternating group graphs among known uni-directional topologies.