Fibonacci cube

<p>In the <a href="/facts/Mathematical/pxTouaz4">mathematical</a> field of <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, the Fibonacci cubes or Fibonacci networks are a family of <a href="/facts/Undirected_graph/kw3eIBUe">undirected graphs</a> with rich <a href="/facts/Recursive/CxSKxJoW">recursive</a> properties derived from its origin in <a href="/facts/Number_theory/zhoa7zrc">number theory</a>. Mathematically they are similar to the <a href="/facts/Hypercube_graph/pwfGEl9J">hypercube graphs</a>, but with a <a href="/facts/Fibonacci_number/mqxpAUQD">Fibonacci number</a> of <a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertices</a>. Fibonacci cubes were first explicitly defined in Hsu (1993) in the context of interconnection topologies for connecting parallel or distributed systems.  They have also been applied in <a href="/facts/Chemical_graph_theory/bst0G88w">chemical graph theory</a>. 
</p><p>The Fibonacci cube may be defined in terms of <a href="/facts/Fibonacci_code/GXCLAf7t">Fibonacci codes</a> and <a href="/facts/Hamming_distance/MgdtbYPo">Hamming distance</a>, <a href="/facts/Independent_set_(graph_theory)/ksu46kdz">independent sets</a> of vertices in <a href="/facts/Path_graph/4Y2f35eM">path graphs</a>, or via <a href="/facts/Distributive_lattice/97DFz1cu">distributive lattices</a>.
</p>

Fibonacci cube open-in-new

Fibonacci cube