Further properties of cayley digraphs and their applications to interconnection networks

  • Authors:
  • Wenjun Xiao;Behrooz Parhami

  • Affiliations:
  • Dept. of Computer Science, South China University of Technology, Guangzhou, P.R. China;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA

  • Venue:
  • TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.