View in EDS

Dimensional edge fault-tolerant Hamiltonicity of (folded) hypercubes.

Saved in:
Bibliographic Details
Title: Dimensional edge fault-tolerant Hamiltonicity of (folded) hypercubes.
Authors: Cai, Junqing1,2 (AUTHOR), Chen, Meirun3 (AUTHOR), Lin, Cheng-Kuan1,4 (AUTHOR) cklin@nycu.edu.tw
Source: Discrete Applied Mathematics. May2026, Vol. 384, p154-164. 11p.
Subjects: Hypercubes, Fault tolerance (Engineering), Parallel programming, Hamiltonian graph theory
Abstract: The hypercube Q n and folded hypercube F Q n serve as fundamental interconnection network topologies in parallel computing, valued for their efficient communication and inherent fault tolerance. This paper investigates their resilience to dimensional-edge faults with respect to three critical Hamiltonian properties: Hamiltonicity, Hamiltonian laceability, and hyper Hamiltonian laceability. We establish precise bounds for fault tolerance in these structures, proving that: (1) For Q n , both the dimensional-edge fault-tolerant Hamiltonicity and Hamiltonian laceability equal 2 n − 1 − n , while hyper Hamiltonian laceability tolerates up to 2 n − 1 − 2 n + 2 ; (2) For F Q n , the dimensional-edge fault-tolerant Hamiltonicity is 2 n − n ; (3) For odd-dimensional F Q 2 n + 1 , the dimensional-edge fault-tolerant Hamiltonian laceability and hyper Hamiltonian laceability are 2 2 n + 1 − 2 n − 1 and 2 2 n + 1 − 4 n , respectively. These results significantly advance our understanding of fault tolerance in cube-based network topologies and provide rigorous theoretical guarantees for their reliable operation in practical systems. [ABSTRACT FROM AUTHOR]
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 192002127
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Dimensional edge fault-tolerant Hamiltonicity of (folded) hypercubes.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Cai%2C+Junqing%22">Cai, Junqing</searchLink><relatesTo>1,2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Chen%2C+Meirun%22">Chen, Meirun</searchLink><relatesTo>3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Lin%2C+Cheng-Kuan%22">Lin, Cheng-Kuan</searchLink><relatesTo>1,4</relatesTo> (AUTHOR)<i> cklin@nycu.edu.tw</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Applied+Mathematics%22">Discrete Applied Mathematics</searchLink>. May2026, Vol. 384, p154-164. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Hypercubes%22">Hypercubes</searchLink><br /><searchLink fieldCode="DE" term="%22Fault+tolerance+%28Engineering%29%22">Fault tolerance (Engineering)</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+programming%22">Parallel programming</searchLink><br /><searchLink fieldCode="DE" term="%22Hamiltonian+graph+theory%22">Hamiltonian graph theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The hypercube Q n and folded hypercube F Q n serve as fundamental interconnection network topologies in parallel computing, valued for their efficient communication and inherent fault tolerance. This paper investigates their resilience to dimensional-edge faults with respect to three critical Hamiltonian properties: Hamiltonicity, Hamiltonian laceability, and hyper Hamiltonian laceability. We establish precise bounds for fault tolerance in these structures, proving that: (1) For Q n , both the dimensional-edge fault-tolerant Hamiltonicity and Hamiltonian laceability equal 2 n − 1 − n , while hyper Hamiltonian laceability tolerates up to 2 n − 1 − 2 n + 2 ; (2) For F Q n , the dimensional-edge fault-tolerant Hamiltonicity is 2 n − n ; (3) For odd-dimensional F Q 2 n + 1 , the dimensional-edge fault-tolerant Hamiltonian laceability and hyper Hamiltonian laceability are 2 2 n + 1 − 2 n − 1 and 2 2 n + 1 − 4 n , respectively. These results significantly advance our understanding of fault tolerance in cube-based network topologies and provide rigorous theoretical guarantees for their reliable operation in practical systems. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=192002127
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.dam.2025.12.051
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 154
    Subjects:
      – SubjectFull: Hypercubes
        Type: general
      – SubjectFull: Fault tolerance (Engineering)
        Type: general
      – SubjectFull: Parallel programming
        Type: general
      – SubjectFull: Hamiltonian graph theory
        Type: general
    Titles:
      – TitleFull: Dimensional edge fault-tolerant Hamiltonicity of (folded) hypercubes.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Cai, Junqing
      – PersonEntity:
          Name:
            NameFull: Chen, Meirun
      – PersonEntity:
          Name:
            NameFull: Lin, Cheng-Kuan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 05
              Text: May2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 0166218X
          Numbering:
            – Type: volume
              Value: 384
          Titles:
            – TitleFull: Discrete Applied Mathematics
              Type: main
ResultId 1