On the Existence of Hamiltonian Circuits in Faulty Hypercubes
From MaRDI portal
Publication:3985536
DOI10.1137/0404045zbMath0747.05035OpenAlexW1995467644MaRDI QIDQ3985536
Publication date: 27 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0404045
Searching and sorting (68P10) Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (43)
Longest fault-free paths in hypercubes with vertex faults ⋮ Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Hamiltonian paths with prescribed edges in hypercubes ⋮ Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ Path bipancyclicity of hypercubes ⋮ Edge-bipancyclicity of conditional faulty hypercubes ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ Embedding longest fault-free paths in arrangement graphs with faulty vertices ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Hamiltonian fault-tolerance of hypercubes ⋮ Conditional edge-fault-tolerant Hamiltonicity of dual-cubes ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Regular connected bipancyclic spanning subgraphs of hypercubes ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ Efficient Connectivity Testing of Hypercubic Networks with Faults ⋮ Hamiltonian cycles and paths in hypercubes with disjoint faulty edges ⋮ Fault-tolerant cycle embedding in the faulty hypercubes ⋮ Hamiltonian cycles in hypercubes with faulty edges ⋮ Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Fault-free Hamiltonian cycles in twisted cubes with conditional link faults ⋮ Fault tolerance in \(k\)-ary \(n\)-cube networks ⋮ Conditional fault Hamiltonicity of the complete graph ⋮ A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges ⋮ Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges ⋮ Computational complexity of long paths and cycles in faulty hypercubes ⋮ Edge‐fault‐tolerant pancyclicity of alternating group graphs ⋮ Conditional fault hamiltonian connectivity of the complete graph ⋮ Panconnectivity and edge-pancyclicity ofk-aryn-cubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Fault-free longest paths in star networks with conditional link faults ⋮ Embedding Hamiltonian cycles in alternating group graphs under conditional fault model ⋮ Long paths in hypercubes with conditional node-faults ⋮ Linear array and ring embeddings in conditional faulty hypercubes ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs ⋮ Survey on path and cycle embedding in some networks ⋮ On the extremal number of edges in Hamiltonian connected graphs ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model ⋮ Algorithmic construction of Hamiltonians in pyramids
This page was built for publication: On the Existence of Hamiltonian Circuits in Faulty Hypercubes
