Bijective Connection Graphs Beginning with a c-node seed network, the network size is recursively doubled in each step by linking nodes in the two halves via an arbitrary one-to-one mapping. Number of nodes=c 2q Hypercube is a special case, as are many hypercube variant networks (twisted, crossed, mobius,., cubes) Bijective mapping Special case of c= Diameter upper bound is q Diameter lower bound is an open problem(it is better than[ +1 v2) Fa2010 Parallel Processing, Low-Diameter Architectures Slide 24Fall 2010 Parallel Processing, Low-Diameter Architectures Slide 24 Bijective Connection Graphs Beginning with a c-node seed network, the network size is recursively doubled in each step by linking nodes in the two halves via an arbitrary one-to-one mapping. Number of nodes = c 2 q Hypercube is a special case, as are many hypercube variant networks (twisted, crossed, mobius, . . . , cubes) Bijective mapping Special case of c = 1: Diameter upper bound is q Diameter lower bound is an open problem (it is better than q + 1/2)