Hamiltonicity of hypercubes with faulty vertices

DOI10.1016/J.IPL.2015.09.018MaRDI QIDQ5964820zbMATH OpenOpenAlexFDO

Authors Xiebin Chen

Publication date 1 March 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.09.018

zbMATH Keywords

fault toleranceHamilton laceabilityHamiltonian cyclehypercubeLocke's conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• Hamiltonian cycles in hypercubes with faulty edges
• Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
• Hamiltonian cycles in hypercubes with more faulty edges
• Hamiltonian laceability in hypercubes with faulty edges
• Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
• Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
• Hamiltonian fault-tolerance of hypercubes
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes

Cites work

• Cycles embedding in hypercubes with node failures
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Graph theory
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many disjoint paths in faulty hypercubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired many-to-many disjoint path covers of the hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path coverings with prescribed ends in faulty hypercubes
• Path embedding in faulty hypercubes
• Path partitions of hypercubes
• Spanning multi-paths in hypercubes
• Survey on path and cycle embedding in some networks
• The 2-path-bipanconnectivity of hypercubes

Cited in

(11)

• Hamiltonian cycles and paths in faulty twisted hypercubes
• Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
• Exploration of Faulty Hamiltonian Graphs
• Hamiltonian laceability of hypercubes with faults of charge one
• Hamiltonicity in vertex-deleted hypercubes
• On the maximal connected component of hypercube with faulty vertices (II)
• Hamiltonian laceability of hypercubes without isometric subgraphs
• Proof of Locke's conjecture. I
• The h-step limited star connectivity of hypercubes
• Structure fault diameter of hypercubes
• Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes

This page was built for publication: Hamiltonicity of hypercubes with faulty vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964820)