A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Group action graphs and parallel architectures
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
IEEE Transactions on Parallel and Distributed Systems
Incomplete k-ary n-cube and its derivatives
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
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.