Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks
In this short communication, we extend the known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general results on homomorphism and distance between them. Intuitively, our results correspond to synthesizing alternative, more economical, interconnection networks by reducing the number of dimensions and/or link density of existing networks via mapping and pruning. We discuss applications of these results to well-known and useful interconnection networks such as hexagonal and honeycomb meshes.
KeywordsMesh Network Cayley Graph Interconnection Network Semidirect Product Pruning Scheme
Unable to display preview. Download preview PDF.
- 3.Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)Google Scholar
- 4.Heydemann, M.: Cayley Graphs and Interconnection Networks. Graph Symmetry: Algebraic Methods and Applications, 167–224 (1997)Google Scholar
- 7.Parhami, B.: Introduction to Parallel Processing: Algorithms and Architectures. Plenum (1999)Google Scholar
- 9.Parhami, B., Kwai, D.M.: Incomplete k-ary n-cube and Its Derivatives. J. Parallel and Distributed Computing (to appear)Google Scholar