Issue No. 01 - January (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.205649
<p>A novel interconnection topology called the Fibonacci cube is shown to possessattractive recurrent structures in spite of its asymmetric and relatively sparseinterconnections. 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 findapplications in fault-tolerant computing. For a graph with N nodes, the diameter, theedge connectivity, and the node connectivity of the Fibonacci cube are in the logarithmicorder of N. It is also shown that common system communication primitives can beimplemented efficiently.</p>
Index Termssubgraph embedding; interconnection topology; Fibonacci cube; recurrent structures;sparse interconnections; Boolean cube; hypercube; supergraph; fault-tolerant computing;node connectivity; system communication primitives; graph theory; multiprocessorinterconnection networks; topology
W. Hsu, "Fibonacci Cubes-A New Interconnection Technology," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 3-12, 1993.