Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
From MaRDI portal
(Redirected from Publication:545386)
Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
Recommendations
- Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
- Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
Cites work
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Complete path embeddings in crossed cubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Edge-pancyclicity of Möbius cubes
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
- Graph theory
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
- Hamiltonian paths with prescribed edges in hypercubes
- Lee distance and topological properties of k-ary n-cubes
- Path embeddings in faulty 3-ary \(n\)-cubes
Cited in
(21)- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
- A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube
- Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
- Path embeddings with prescribed edge in the balanced hypercube network
- A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- Hamiltonian paths passing through prescribed edges in balanced hypercubes
- Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
- Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
- Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Hamiltonian properties of honeycomb meshes
- Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
- Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
- A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
- 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
- Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
This page was built for publication: Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545386)
