EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE

DOI10.1142/S0129053300000151zbMath1003.68007OpenAlexW2070058209MaRDI QIDQ4550162

Jen-Chih Lin

Publication date: 31 October 2002

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129053300000151

zbMATH Keywords

Hamiltonian cyclesringslinear arraysfaulty supercube

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Multiple regular graph embeddings into a hypercube with unbounded expansion

Cites Work

• Supercube: An optimally fault tolerant network architecture
• On fault-tolerant embedding of Hamiltonian cycles, linear arrays and rings in a flexible hypercube
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• On the conversion between binary code and binary-reflected Gray code on binary cubes

This page was built for publication: EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE