Embeddings of Hamiltonian paths in faulty k-ary 2-cubes
From MaRDI portal
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Eulerian and Hamiltonian graphs (05C45) Applications of graph theory to circuits and networks (94C15)
Recommendations
- Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
- Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
- Path embeddings in faulty 3-ary \(n\)-cubes
- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
- Hamiltonian cycles and paths in faulty twisted hypercubes
- Path embedding in faulty hypercubes
- Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
Cited in
(6)- Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
- Embedding long cycles in faulty \(k\)-ary \(2\)-cubes
- Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
- Path embeddings in faulty 3-ary \(n\)-cubes
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
This page was built for publication: Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906366)
