A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes

DOI10.1007/978-3-030-57602-8_40zbMath1482.68184OpenAlexW3048011305MaRDI QIDQ2039695

Kung-Jui Pai

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_40

zbMATH Keywords

interconnection networkscrossed cubesedge-disjoint Hamiltonian cycles

Mathematics Subject Classification ID

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

Related Items (1)

Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes

Cites Work

• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Two edge-disjoint hamiltonian cycles in the butterfly graph
• Topological properties of the crossed cube architecture
• On edge-disjoint spanning trees in hypercubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Edge-disjoint Hamiltonian cycles in hypertournaments
• A low-cost fault-tolerant structure for the hypercube

This page was built for publication: A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes