Generalized Fibonacci Cubes

Authors:
W. J. Hsu;M. J. Chung
Affiliations:
Nanyang Technological University, Singapore;Nanyang Technological University, Singapore
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Year:
1993

Citing 0
Cited 4

Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Finding Hamiltonian Cycles on Incrementally Extensible Hypercube Graphs

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Unicast, Multicast, and Broadcast on Enhanced Fibonacci Cubes

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
The Josephus Cube: analysis of routing and fault tolerance

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new class of interconnection topolo gies called the generalized Fibonacci cubes (GFCs, for short) that encompass a range of networks such as the popular Boolean cube (hypercube) and the recent second-order Fibonacci cube in [5]. We show that each GFC has a recursive and self-similar structure and hence exhibits fault tolerant features. We also show that each GFC admits simple embedding of other useful net works such as cycles, trees, and meshes. The GFCs may find applications in fault-tolerant com puting.