A new family of Cayley graph interconnection networks of constant degree four
Premkumar Vadapalli, Pradip K. Srimani · IEEE Transactions on Parallel and Distributed Systems · 1996
We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter, and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant degree 4.