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

DOI10.1016/J.IPL.2008.02.013MaRDI QIDQ963431zbMATH OpenOpenAlexFDO

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

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

hamiltonian cyclehamiltonian pathinterconnection networks

Mathematics Subject Classification ID

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

Recommendations

• Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• scientific article; zbMATH DE number 434488
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Hamiltonicity of hypercubes with a constraint of required and faulty edges

Cites work

• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Complete path embeddings in crossed cubes
• Cycles in butterfly graphs
• Cycles in the cube-connected cycles graph
• Embedding of cycles in arrangement graphs
• Graph theory
• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3641471 (Why is no real title available?)
• On the spanning connectivity and spanning laceability of hypercube-like networks
• Panconnectivity of locally twisted cubes
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

Cited in

(12)

• On the bipanpositionable bipanconnectedness of hypercubes
• Hamiltonian paths in hypercubes with local traps
• Spanning multi-paths in hypercubes
• Disjoint cycles in hypercubes with prescribed vertices in each cycle
• scientific article; zbMATH DE number 434488 (Why is no real title available?)
• Two spanning disjoint paths with required length in generalized hypercubes
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
• The 2-path-bipanconnectivity of hypercubes
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
• The spanning connectivity of folded hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963431)