A class of hypercube-like networks

Abstract

We introduce a class of graphs which are variants of the hypercube graph. Many of the properties of this class of graphs are similar to that of the hypercube hence, we refer to them as the class of hypercube-like graphs/networks. We show that the hypercube, the twisted n-cube and the multiply-twisted cube are members of this class of graphs. We also propose simple strategies for distributed routing and broadcast and discuss some issues regarding embedding other graphs and reconfiguration in such networks.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>