Some Topological Properties of Star Connected Cycles

Abstract Star connected cycles are shown to be an undirected Cayley graph, and the graph automorphism group is determined. A routing algorithm is given, which finds an optimal path in polynomial time. The diameter and tight bounds on the average distance are computed.

[1]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[2]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[3]  Gunnar E. Carlsson,et al.  Interconnection Networks Based on a Generalization of Cube-Connected Cycles , 1985, IEEE Transactions on Computers.

[4]  Shahram Latifi,et al.  A Well-Behaved Enumeration of Star Graphs , 1995, IEEE Trans. Parallel Distributed Syst..

[5]  Selim G. Akl,et al.  Optimal Communication algorithms on Star Graphs Using Spanning Tree Constructions , 1995, J. Parallel Distributed Comput..

[6]  C. Y. Roger Chen,et al.  Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles , 1993, IEEE Trans. Parallel Distributed Syst..

[7]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8]  Shahram Latifi,et al.  The Star Connected Cycles: A Fixed-Degree Network For Parallel Processing , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[9]  Shahram Latifi,et al.  Average distance and routing algorithms in the star-connected cycles interconnection network , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[10]  C. Y. Roger Chen,et al.  Communication Aspects of the Cube Connected Cycles , 1990, ICPP.