Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes

DOI10.1016/j.dam.2011.05.008zbMath1231.05162OpenAlexW2071194539MaRDI QIDQ642966

Yuxing Yang, Jing Li, Shang-Wei Lin, Shi-ying Wang

Publication date: 27 October 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.05.008

zbMATH Keywords

Hamiltonian cyclesinterconnection networks\(k\)-ary \(n\)-cubeslinear forests

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Unchanging the diameter ofk-aryn-cube networks with faulty vertices

Cites Work

• Unnamed Item
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
• 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
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• On \(k\)-ary \(n\)-cubes: Theory and applications.
• Hamiltonian paths with prescribed edges in hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Panconnectivity and edge-pancyclicity ofk-aryn-cubes
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Cycle and Path Embedding on 5-ary N-cubes
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Lee distance and topological properties of k-ary n-cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes