Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
From MaRDI portal
Publication:2258909
DOI10.1007/s11464-013-0344-4zbMath1307.05131OpenAlexW2160562473MaRDI QIDQ2258909
Publication date: 27 February 2015
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-013-0344-4
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items
A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
Cites Work
- Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
- Cycles passing through a prescribed path in a hypercube with faulty edges
- Path embeddings in faulty 3-ary \(n\)-cubes
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Embedding of cycles in twisted cubes with edge-pancyclic
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- On path bipancyclicity of hypercubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- Survey on path and cycle embedding in some networks
- The paths embedding of the arrangement graphs with prescribed vertices in given position
- Pancyclicity of ternary \(n\)-cube networks under the conditional fault model
- Hamiltonian paths with prescribed edges in hypercubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Panconnectivity and edge-pancyclicity ofk-aryn-cubes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Algorithms and Computation
