The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1995 vol.44)
pp: 593-597
ABSTRACT
<p><it>Abstract</it>—In this paper we consider the Supercube, a new interconnection network derived from the Hypercube. The Supercube, introduced by Sen in [<ref rid="BIBC059310" type="bib">10</ref>], has the same diameter and connectivity as a Hypercube but can be realized for any number of nodes, not only powers of 2.</p><p>We study the Supercube’s ability to execute parallel programs, using graph-embedding techniques. We show that complete binary trees and bidimensional meshes (with a side length power of 2) are spanning subgraphs of the Supercube. We then prove that the Supercube is Hamiltonian and, when the number of nodes is not a power of 2, it contains all cycles of length greater than 3 as subgraphs.</p>
INDEX TERMS
Cycles, graph embedding, Hamiltonian cycle, parallel architectures, Supercube.
CITATION
Adele Anna Rescigno, Vincenzo Auletta, Vittorio Scarano, "Embedding Graphs onto the Supercube", IEEE Transactions on Computers, vol.44, no. 4, pp. 593-597, April 1995, doi:10.1109/12.376173
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool