Embedding Graphs onto the Supercube

  • Authors:
  • Adele Anna Rescigno;Vincenzo Auletta;Vittorio Scarano

  • Affiliations:
  • -;-;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1995

Quantified Score

Hi-index 14.98

Visualization

Abstract

In this paper we consider the Supercube, a new interconnection network derived from the Hypercube. The Supercube, introduced by Sen in [10], has the same diameter and connectivity as a Hypercube but can be realized for any number of nodes, not only powers of 2.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.