1993/01/01 by Wei-Cheng Hsu · 275 citations
Computer Science · Engineering · Materials Science · Mathematics · #Interconnection Networks and Systems #Advanced Memory and Neural Computing #Graphene research and applications #Hypercube #Computer science #Epigraph #Interconnection #Cube (algebra) #Topology (electrical circuits) #Fibonacci number #Network topology #Logarithm #Node (physics) #Combinatorics #Parallel computing #Mathematics #Computer network
paper · doi:10.1109/71.205649
published in IEEE Transactions on Parallel and Distributed Systems 4(1), 3-12 (Institute of Electrical and Electronics Engineers)
openalex publication_date 1993/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
A novel interconnection topology called the Fibonacci cube is shown to possess attractive recurrent structures in spite of its asymmetric and relatively sparse interconnections. Since it can be embedded as a subgraph in the Boolean cube (hypercube) and it is also a supergraph of other structures, the Fibonacci cube may find applications in fault-tolerant computing. For a graph with N nodes, the diameter, the edge connectivity, and the node connectivity of the Fibonacci cube are in the logarithmic order of N. It is also shown that common system communication primitives can be implemented efficiently.>