Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary n-cube with faulty edges
From MaRDI portal
Publication:2258909
Recommendations
- Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
- Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges.
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Hamiltonian cycles passing through linear forests in k-ary n-cubes
- Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
Cites work
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Algorithms and Computation
- Cycles passing through a prescribed path in a hypercube with faulty edges
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Embedding of cycles in twisted cubes with edge-pancyclic
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Hamiltonian paths with prescribed edges in hypercubes
- On path bipancyclicity of hypercubes
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes
- Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
- Pancyclicity of ternary n-cube networks under the conditional fault model
- Path embeddings in faulty 3-ary \(n\)-cubes
- Survey on path and cycle embedding in some networks
- The paths embedding of the arrangement graphs with prescribed vertices in given position
Cited in
(12)- Hamiltonian cycles passing through linear forests in k-ary n-cubes
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
- The embedding cycle in 3-ary \(n\) cubes with conditional fault edges
- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
- Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- 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
- A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
This page was built for publication: Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2258909)
