Vaidya, Aniruddha S and Rao, Nagendra PS and Shankar, Ravi S (1993) A Class of Hypercube-like Networks. In: Fifth IEEE Symposium on Parallel and Distributed Processing, 1993, 1-4 December, Dallas,TX, 800 -803.
We introduce a class of graphs which are variants of the hypercube graph. Many of the properties of this class of graphs are similar t o that of the hypercube hence, we refer to them as the class of Hypercube-Like (HL) graphs/networks. We show that the hypercube, the twisted n-cube [l] 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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Engineering|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:27|
Actions (login required)