Live briefing
Everything about Fibonacci cube
Family of graphs based on the Fibonacci sequence
In the mathematical field of graph theory, the Fibonacci cubes or Fibonacci networks are a family of undirected graphs with rich recursive properties derived from its origin in number theory. Mathematically they are similar to the hypercube graphs, but with a Fibonacci number of vertices. 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 chemical graph theory. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Fibonacci cubeA 5-minute orientation
- Skim a recent paper: q–counting geodesics in the Fibonacci cubeInfluential work since 2022
- Pick up a classic book: Professor Stewart's incredible numbersThe most-reprinted book on the subject
- Read the landmark paper: Cube Polynomial of Fibonacci and Lucas CubesCited 28 times
- Go sideways: Partial cubeA closely related topic
- Go sideways: Fence (mathematics)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Cube Polynomial of Fibonacci and Lucas Cubes
Recursive fault-tolerance of Fibonacci cube in hypercubes
Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle
About the cube polynomial of Extended Fibonacci Cubes
Distance cube polynomials of Fibonacci and Lucas-run graphs
Cube-complements of generalized Fibonacci cubes
Prefixes of the Fibonacci word that end with a cube
From tiling to matching: exploring Fibonacci cube structures
🆕 Influential since 2022
📚 Books worth reading
Professor Stewart's incredible numbersIan Stewart · 2015
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
Beautiful GeometryEli Maor, Eugen Jost · 2014- 📕Fibonacci Cubes Applications VariationhbAL · 2023
- 📕Super sumsRob Colson · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Partial cube In graph theory, a partial cube is a graph that is an isometric subgraph of a hypercube. In other words, a partial cube can be identified with a subgraph…
- Fence (mathematics) In mathematics, a fence, also called a zigzag poset, is a partially ordered set (poset) in which the order relations form a path with alternating orientations:…
- Simplex graph In graph theory, a branch of mathematics, the simplex graph κ(G) of an undirected graph G is itself a graph, with one node for each clique (a set of mutually…
- Median graph In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a, b, and c have a unique median: a vertex…
- Hypercube graph In graph theory, the hypercube graph Qn is the edge graph of the n-dimensional hypercube, that is, it is the graph formed from the vertices and edges of…
- Edge coloring In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Modular graph In graph theory, a branch of mathematics, the modular graphs are undirected graphs in which every three vertices x, y, and z have at least one median vertex…