Finding Hamiltonian Cycles on Incrementally Extensible Hypercube Graphs

Authors:
Eric Chou
Affiliations:
-
Venue:
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Year:
1997

Citing 8
Cited 1

Incomplete Hypercubes

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
Supercube: An optimally fault tolerant network architecture

Acta Informatica
On the embedding of cycles in pancake graphs

Parallel Computing
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions

IEEE Transactions on Computers
Embedding Graphs onto the Supercube

IEEE Transactions on Computers
Generalized Fibonacci Cubes

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Generalized Hypercube and Hyperbus Structures for a Computer Network

IEEE Transactions on Computers

A novel optimal routing and a fault-tolerant routing for the incrementally extensible hypercube network

SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The existence of a Hamiltonian cycle is the premise of usages in an interconnection network. A novel interconnection network, the Incrementally Extensible Hypercube (IEH) graph, has been proposed recently. The IEH graphs are derived from hypercubes and also retain most parts of properties in hypercubes. Unlike hypercubes without incrementally extensibility, IEH graphs can be constructed in any number of nodes. In this paper, we present an algorithm to find a Hamiltonian cycle or path and prove that there exists a Hamiltonian cycle in all of IEH graphs except for those containing exactly (2^n)-1 nodes.