Vertex-transitivity and routing for Cayley graphs in GCR representations

  title={Vertex-transitivity and routing for Cayley graphs in GCR representations},
  author={K. Wendy Tang and Bruce W. Arden},
Dense, symmetric graphs are good candidates for effective interconnection networks. Cayley graphs, formed by Borel subgroups, are the densest, symmetric graphs known for a range of diameters [1]. Every Cayley graph can be represented with integer node labels by transforming into another existing topology, Generalized Chordal Ring (GCR) [2]. However… CONTINUE READING