Vertex-transitivity and routing for Cayley graphs in GCR representations

Authors:
K. Wendy Tang;Bruce W. Arden
Affiliations:
Department of Electrical Engineering, SUNY at Stony Brook, Stony Brook, NY;Department of Electrical Engineering, University of Rochester, Rochester NY
Venue:
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Year:
1992

Citing 6
Cited 4

Strategies for interconnection networks: some methods from graph theory

Journal of Parallel and Distributed Computing
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Dynamic routing for regular direct computer networks

Dynamic routing for regular direct computer networks
Routing for generalized chordal rings

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Graph Theory With Applications

Graph Theory With Applications

Diagonal and Toroidal Mesh Networks

IEEE Transactions on Computers
Class-Congruence Property and Two-Phase Routing of Borel Cayley Graphs

IEEE Transactions on Computers
A graph theoretic approach to ultrafast information distribution: Borel Cayley graph resizing algorithm

Computer Communications
Expanded Borel Cayley Graphs (Ex-BCGs): A novel communication topology for multi-agent systems

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract