Path embedding on folded hypercubes

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

Abstract

We analyze some edge-fault-tolerant properties of the folded hypercube, which is a variant of the hypercube obtained by adding an edge to every pair of nodes with complementary address. We show that an n-dimensional folded hypercube is (n - 2)-edge-fault-tolerant Hamiltonian-connected when n(≥ 2) is even, (n - 1)-edge-fault-tolerant strongly Hamiltonian-laceable when n(≥ 1) is odd, and (n - 2)-edge-fault-tolerant hyper Hamiltonian-laceable when n(≥ 3) is odd.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 4th International Conference, TAMC 2007, Proceedings
PublisherSpringer Verlag
Pages750-759
Number of pages10
ISBN (Print)3540725032, 9783540725039
DOIs
Publication statusPublished - 2007
Event4th International Conference on Theory and Applications of Models of Computation, TAMC 2007 - Shanghai, China
Duration: 2007 May 222007 May 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4484 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Theory and Applications of Models of Computation, TAMC 2007
CountryChina
CityShanghai
Period07-05-2207-05-25

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Path embedding on folded hypercubes'. Together they form a unique fingerprint.

Cite this