Smaller diameters in hypercube-variant networks

A number of hypercube-variant networks attempt to improve the hypercube by adding extra connections and thus reducing the diameter of the constructed network. We briefly outline a model which describes these variant networks. Further, we show that by restricting this model, we can describe hypercube variants with exactly the same number of edges as the hypercube. We mentio n several such networks which all have diameter about n/2. We describe a ne w network within this class that has diameter about 2n/5, thus improving th e best known previous bound by a constant factor. We show that within a lim ited construction paradigm our network is best possible.