A Class of Hypercube-Like Networks

W e introduce a class of graphs which are variants of the hypercube graph. M a n y of the properties of this class of graphs are similar to that of the hypercube hence, we refer to t h e m as the class of Hypercube-Like (HL) graphs/networks. W e show that the hypercube, the twisted n-cube [l]and the multiply-twisted cube [2] are members of this class of graphs. W e also propose simple strategies f o r distributed muting and broadcast and discuss some issues regarding embedding other graphs and reconfiguration in such networks.

• Type: Conference
• Year: 1993
• Where: SPDP
• Authors: Aniruddha S. Vaidya, P. S. Nagendra Rao, S. Ravi Shankar
• Keywords: Distributed And Parallel Computing, Hypercube Graph, Multiply-twisted Cube, Simple Strategies, SPDP 1993