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

27 Citations (Scopus)

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
CountryUnited States
CityNewport
Period4/13/934/16/93

Fingerprint

Hamiltonians

ASJC Scopus subject areas

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

Cite this

Sen, A., Sengupta, A., & Bandyopadhyay, S. (1993). On some topological properties of hypercube, incomplete hypercube and supercube. In Proceedings of 7th International Parallel Processing Symposium, IPPS 1993 (pp. 636-642). [262806] (Proceedings of 7th International Parallel Processing Symposium, IPPS 1993). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPPS.1993.262806

On some topological properties of hypercube, incomplete hypercube and supercube. / Sen, Arunabha; Sengupta, A.; Bandyopadhyay, S.

Proceedings of 7th International Parallel Processing Symposium, IPPS 1993. Institute of Electrical and Electronics Engineers Inc., 1993. p. 636-642 262806 (Proceedings of 7th International Parallel Processing Symposium, IPPS 1993).

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

Sen, A, Sengupta, A & Bandyopadhyay, S 1993, On some topological properties of hypercube, incomplete hypercube and supercube. in Proceedings of 7th International Parallel Processing Symposium, IPPS 1993., 262806, Proceedings of 7th International Parallel Processing Symposium, IPPS 1993, Institute of Electrical and Electronics Engineers Inc., pp. 636-642, 7th International Parallel Processing Symposium, IPPS 1993, Newport, United States, 4/13/93. https://doi.org/10.1109/IPPS.1993.262806
Sen A, Sengupta A, Bandyopadhyay S. On some topological properties of hypercube, incomplete hypercube and supercube. In Proceedings of 7th International Parallel Processing Symposium, IPPS 1993. Institute of Electrical and Electronics Engineers Inc. 1993. p. 636-642. 262806. (Proceedings of 7th International Parallel Processing Symposium, IPPS 1993). https://doi.org/10.1109/IPPS.1993.262806
Sen, Arunabha ; Sengupta, A. ; Bandyopadhyay, S. / On some topological properties of hypercube, incomplete hypercube and supercube. Proceedings of 7th International Parallel Processing Symposium, IPPS 1993. Institute of Electrical and Electronics Engineers Inc., 1993. pp. 636-642 (Proceedings of 7th International Parallel Processing Symposium, IPPS 1993).
@inproceedings{5bdb39ca73ac4fb4a381aef0ff795a68,
title = "On some topological properties of hypercube, incomplete hypercube and supercube",
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)!.",
author = "Arunabha Sen and A. Sengupta and S. Bandyopadhyay",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/IPPS.1993.262806",
language = "English (US)",
series = "Proceedings of 7th International Parallel Processing Symposium, IPPS 1993",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "636--642",
booktitle = "Proceedings of 7th International Parallel Processing Symposium, IPPS 1993",

}

TY - GEN

T1 - On some topological properties of hypercube, incomplete hypercube and supercube

AU - Sen, Arunabha

AU - Sengupta, A.

AU - Bandyopadhyay, S.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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)!.

AB - 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)!.

UR - http://www.scopus.com/inward/record.url?scp=85025287974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85025287974&partnerID=8YFLogxK

U2 - 10.1109/IPPS.1993.262806

DO - 10.1109/IPPS.1993.262806

M3 - Conference contribution

AN - SCOPUS:85025287974

T3 - Proceedings of 7th International Parallel Processing Symposium, IPPS 1993

SP - 636

EP - 642

BT - Proceedings of 7th International Parallel Processing Symposium, IPPS 1993

PB - Institute of Electrical and Electronics Engineers Inc.

ER -