Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes

DOI10.1007/978-3-030-89543-3_31OpenAlexW3209265467MaRDI QIDQ2695301

Kung-Jui Pai

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_31

zbMATH Keywords

interconnection networkslocally twisted cubesedge-disjoint Hamiltonian cycles

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Two edge-disjoint hamiltonian cycles in the butterfly graph
• A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes
• A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
• Edge-disjoint Hamiltonian cycles in hypertournaments
• The locally twisted cubes
• A low-cost fault-tolerant structure for the hypercube

This page was built for publication: Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes