Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position

DOI10.1016/j.ipl.2008.02.013zbMath1185.05095OpenAlexW2023902199MaRDI QIDQ963431

Lih-Hsing Hsu, Chung-Meng Lee, Jimmy J. M. Tan

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.013

zbMATH Keywords

interconnection networkshamiltonian cyclehamiltonian path

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Two spanning disjoint paths with required length in generalized hypercubes ⋮ The disjoint path cover in the data center network HSDC with prescribed vertices in each path ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ The spanning connectivity of folded hypercubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ On the bipanpositionable bipanconnectedness of hypercubes ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spanning connectivity and spanning laceability of hypercube-like networks
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Cycles in the cube-connected cycles graph
• Panconnectivity of locally twisted cubes
• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• Complete path embeddings in crossed cubes
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Cycles in butterfly graphs
• Embedding of cycles in arrangement graphs

This page was built for publication: Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position