---
tag: 8DP4V0JEXD
kind: concept
name: Halved cube graph
sources:
  - wikipedia: en:39329236@r1317741200
    locator: Halved cube graph
    note: adopted
    mention: wikipedia://en/39329236
    sections: [Summary]
same_as:
  wikidata: Q13077214
  wikipedia: Halved cube graph
inventory: [JPK1J5J4AP]
---

## Summary

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 at [[distance|0QV9VNNB4Z]] exactly two from each other in the hypercube graph. That is, it is the half-square of the hypercube. This connectivity pattern produces two [[isomorphic graphs|00CT0PTH74]], disconnected from each other, each of which is the halved cube graph.