Further properties of Cayley digraphs and their applications to interconnection networks. (English) Zbl 1178.68053
Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. Third international conference, TAMC 2006, Beijing, China, May 15–20, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34021-1/pbk). Lecture Notes in Computer Science 3959, 192-197 (2006).
Summary: 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.
For the entire collection see [Zbl 1102.68004].
For the entire collection see [Zbl 1102.68004].
MSC:
| 68M10 | Network design and communication in computer systems |
| 05C20 | Directed graphs (digraphs), tournaments |
| 20B25 | Finite automorphism groups of algebraic, geometric, or combinatorial structures |
