On some topological properties of hypercube, incomplete hypercube and supercube

Arunabha Sen, A. Sengupta, S. Bandyopadhyay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

30 Scopus citations

Abstract

Hamiltonian properties of hypercube, incomplete hypercube and supercube are examined. It is known that in a nonfaulty hypercube there are at least n! Hamiltonian cycles. The authors extend this result showing that the lower bound is at least 2/sup n-3/n! They show that with at most n-2 faulty links a faulty hypercube has at least 2(n-2)! Hamiltonian cycles. They establish that an incomplete hypercube with odd (even) number of nodes has (n-2)! Hamiltonian paths (cycles). They show that a supercube has at least (n-1)! Hamiltonian cycles and when the number of nodes is 2/sup n-1/+2/sup n-2/, then the number of Hamiltonian cycles is at least as high as 2(n-1)!.

Original languageEnglish (US)
Title of host publicationProceedings of 7th International Parallel Processing Symposium, IPPS 1993
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages636-642
Number of pages7
ISBN (Electronic)0818634421, 9780818634420
DOIs
StatePublished - Jan 1 1993
Event7th International Parallel Processing Symposium, IPPS 1993 - Newport, United States
Duration: Apr 13 1993Apr 16 1993

Publication series

NameProceedings of 7th International Parallel Processing Symposium, IPPS 1993

Conference

Conference7th International Parallel Processing Symposium, IPPS 1993
Country/TerritoryUnited States
CityNewport
Period4/13/934/16/93

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'On some topological properties of hypercube, incomplete hypercube and supercube'. Together they form a unique fingerprint.

Cite this