Live briefing
Everything about Hypercube graph
Graphs formed by a hypercube's edges and vertices
In graph theory, the hypercube graph is the edge graph of the -dimensional hypercube, that is, it is the graph formed from the vertices and edges of the hypercube. For instance, the cube graph is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. has vertices, edges, and is a regular graph with edges touching each vertex. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Hypercube graphA 5-minute orientation
- Skim a recent paper: Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercubeInfluential work since 2022
- Pick up a classic book: [Quantifying fault recovery in multiprocessor systems]The most-reprinted book on the subject
- Read the landmark paper: Efficient algorithms for list ranking and for solving graph problems on the hypercubeCited 18 times
- Go sideways: Odd graphA closely related topic
- Go sideways: Glossary of graph theoryA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Efficient algorithms for list ranking and for solving graph problems on the hypercube
Parallel graph algorithms for hypercube computers
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Automorphism Group of the Varietal Hypercube Graph
Connectivity of Matching Graph of Hypercube
The 4-star graph is not a subgraph of any hypercube
The Smith group of the hypercube graph
A new graph approach to minimizing processor fragmentation in hypercube multiprocessors
🆕 Influential since 2022
Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
Fault tolerance of composite graph based on disc-ring and folded hypercube
Hypercube Graph Self-Attention Mechanisms for Intelligent Vehicular Intrusion Detection in Autonomous Transport Systems
Graph embedding strategy for efficient routing and optimal wavelength assignment in array-based WDM optical networks with enhanced hypercube topology
Some remarks on the square graph of the hypercube
📚 Books worth reading
- 📕[Quantifying fault recovery in multiprocessor systems]Miroslaw Malek · 1990
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Odd graph In the mathematical field of graph theory, the odd graphs are a family of symmetric graphs defined from certain set systems. They include and generalize…
- 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,…
- Halved cube graph In graph theory, the halved cube graph or half cube graph of dimension n is the vertex-edge graph of the demihypercube, formed by connecting pairs of vertices…
- Italo Jose Dejter Italo Jose Dejter (December 17, 1939) is an Argentine-born American mathematician, a retired professor of mathematics and computer science from the University…
- Clebsch graph In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and…
- Desargues graph In the mathematical field of graph theory, the Desargues graph is a distance-transitive, cubic graph with 20 vertices and 30 edges. It is named after Girard…
- Fibonacci cube In the mathematical field of graph theory, the Fibonacci cubes or Fibonacci networks are a family of undirected graphs with rich recursive properties derived…
- Kneser graph In graph theory, the Kneser graph K(n, k) (alternatively KGn,k) is the graph whose vertices correspond to the k-element subsets of a set of n elements…