Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes

Sun Yuan Hsieh, Che Nan Kuo

Research output: Contribution to journalArticle

44 Citations (Scopus)

Abstract

In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd. We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n = 1 or n (≥ 2) is even.

Original languageEnglish
Pages (from-to)1040-1044
Number of pages5
JournalComputers and Mathematics with Applications
Volume53
Issue number7
DOIs
Publication statusPublished - 2007 Apr 1

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes'. Together they form a unique fingerprint.

  • Cite this