SUPER ROTATOR: INCREMENTALLY EXTENSIBLE DIRECTED NETWORK GRAPH OF SUBLOGARITHMIC DIAMETER
Pradip K. Srimani · Parallel Processing Letters · 1996
We propose a new family of directed interconnection network graphs for an arbitrary number of nodes. The proposed network graph is almost regular (the difference between the in-degrees and out degrees of nodes is 2, a constant independent of the size of the network), has a diameter sub logarithmic in the number of nodes, is optimally fault tolerant and can be defined for an arbitrary number of nodes.