Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube

DOI10.1016/J.INS.2011.03.011zbMATH Open1218.68110OpenAlexW1975829442MaRDI QIDQ545386FDOQ545386

Authors: Ruixia Wang, Jing Li, Shiying Wang 

Publication date: 22 June 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.03.011

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

zbMATH Keywords

Hamiltonian cyclesHamiltonian paths3-ary \(n\)-cubesprescribed edges

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Lee distance and topological properties of k-ary n-cubes
• Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
• Edge-pancyclicity of Möbius cubes
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Path embeddings in faulty 3-ary \(n\)-cubes
• 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-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Hamiltonian paths with prescribed edges in hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Complete path embeddings in crossed cubes

Cited In (19)

• 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
• 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
• Unchanging the diameter ofk-aryn-cube networks with faulty vertices
• 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
• 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

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)