Shortest path routing in a class of Cayley graphs of semi-direct product of finite groups
Fan Wu, S. Lakshmivarahan, Sudarshan Dhall · 2002
Recently R.N. Draper (1990) initiated the study of interconnection networks based on Cayley graphs of semi-direct products of two cyclic groups called supertoroids graphs. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. In this paper we described a deterministic, distributed, shortest path algorithm for routing in this class of networks.>