Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
From MaRDI portal
Publication:2458708
DOI10.1016/j.camwa.2006.10.033zbMath1149.68409OpenAlexW2087737831MaRDI QIDQ2458708
Publication date: 2 November 2007
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2006.10.033
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Related Items (26)
Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs ⋮ Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices ⋮ On \(g\)-extra conditional diagnosability of hypercubes and folded hypercubes ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ Distinguishing graphs via cycles ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Vertex-fault-tolerant cycles embedding on enhanced hypercube networks ⋮ Cycles embedding on folded hypercubes with faulty nodes ⋮ A note on embeddings among folded hypercubes, even graphs and odd graphs ⋮ Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices ⋮ Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\) ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Cycles embedding in folded hypercubes under the conditional fault model ⋮ Fault-tolerant Hamiltonian laceability of balanced hypercubes ⋮ Fault-free cycles in folded hypercubes with more faulty elements ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ On reliability of the folded hypercubes in terms of the extra edge-connectivity ⋮ Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults ⋮ Survey on path and cycle embedding in some networks ⋮ Cycles in folded hypercubes with two adjacent faulty vertices ⋮ Characterizing which powers of hypercubes and folded hypercubes are divisor graphs ⋮ Unnamed Item ⋮ Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Hamiltonian-laceability of star graphs
- The twisted N-cube with application to multiprocessing
This page was built for publication: Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
