Hamiltonian cycles passing through linear forests in k-ary n-cubes
From MaRDI portal
(Redirected from Publication:642966)
Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
Recommendations
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
- Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
- Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
Cites work
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Cycle and Path Embedding on 5-ary N-cubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- 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
- On \(k\)-ary \(n\)-cubes: Theory and applications.
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes
- Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
- Path embeddings in faulty 3-ary \(n\)-cubes
- Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
Cited in
(17)- scientific article; zbMATH DE number 2199618 (Why is no real title available?)
- Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
- Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
- Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
- Ciclos hamiltonianos que pasan a través de un bosque lineal en grafos bipartitos balanceados
- A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- 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 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
- 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 cycles passing through linear forests in \(k\)-ary \(n\)-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642966)
