Abstract
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 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.
T. C Tuan was supported in part by the National Science Council of Taiwan, under Contract 84-2111-M-110-073.
J. S. Jwo was supported in part by the National Science Council of Taiwan, under Contract 84-0208-M-029-014.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Akers, S. B., Harel, D. and Krishnamurthy, B.:The star-graph: an attractive alternative to the n-cube. Proc. the International Conference on Parallel Processing (1987) 393–400
Comellas, F., Fiol, M. A.:Vertex symmetric digraphs with small diameter. Technique Report, Department de Mathematica Aplicada i Telematica, Universitat Politecnica de Catalunya, Spain (2/1992).
Chern, S. C., Tuan, T. C., Jwo, J. S.:On uni-directional hypercubes. Technical Report, Department of Applied Mathematics, National Sun Yat-sen University, Taiwan (1994).
Chou, C. H., Du, David H. C.:Unidirectional hypercubes. Proc. Supercomputing'90 (1990) 254–263
Day, K., Tripathi, A.:Unidirectional star graphs. Info. Proc. Lett. 45 (1993) 123–129
Faber, V., Moore, W., Chen, W. Y. C.:Cycle prefix digraphs for symmetric interconnection networks. Networks 23 (1993) 641–649.
Garey, M. R., Johnson, D. S.:Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company (1979).
Hamidoune, Y.O., Llado, A. S., Serra, O.:The connectivity of hierarchical Cayley digraphs. Disc. Appl. Math. 37/38 (1992) 275–280
Jwo, J. S., Lakshmivarahan, S., Dhall, S.K.:A new class of interconnection network based on the alternating group. Networks 23 (1993) 315–326
Leighton, F. T.:Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann (1992).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chern, SC., Tuan, TC., Jwo, JS. (1995). Uni-directional alternating group graphs. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030870
Download citation
DOI: https://doi.org/10.1007/BFb0030870
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive