Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions

DOI10.1016/J.AMC.2011.04.083zbMath1232.05120OpenAlexW1994848340MaRDI QIDQ555427

Lih-Hsing Hsu, Hon-Chan Chen, Tzu-Liang Kung

Publication date: 22 July 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.04.083

zbMATH Keywords

Hamiltonianinterconnection networkpancycliccycle embeddingcrossed cubehypercube network

Mathematics Subject Classification ID

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

Related Items (7)

Two node-disjoint paths in balanced hypercubes ⋮ Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Improving the panconnectedness property of locally twisted cubes ⋮ Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity ⋮ Multiple regular graph embeddings into a hypercube with unbounded expansion ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of the crossed cube
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
• Fault-tolerant cycle-embedding of crossed cubes
• Topological properties of the crossed cube architecture
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• Complete path embeddings in crossed cubes
• Pancyclic graphs. I
• Embedding binary trees into crossed cubes
• The locally twisted cubes
• Augmented cubes
• Panpositionable hamiltonicity of the alternating group graphs

This page was built for publication: Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions