{
  "aliases": [
    "cube-graph",
    "q-n"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, the **hypercube graph** $Q_n$ is the edge graph of the $n$-dimensional hypercube, that is, it is the graph formed from the vertices and edges of the hypercube. For instance, the cube graph $Q_3$ is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. $Q_n$ has $2^n$ vertices, $2^{n-1}n$ edges, and is a [[regular graph|0KA4S8R39M]] with $n$ edges touching each vertex.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "cube-graph",
      "q-n"
    ],
    "inventory": [
      "60CKR6TEK8"
    ],
    "kind": "concept",
    "name": "Hypercube graph",
    "same_as": {
      "wikidata": "Q958394",
      "wikipedia": "Hypercube graph"
    },
    "sources": [
      {
        "locator": "Hypercube graph",
        "mention": "wikipedia://en/6706815",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:6706815@r1366110735"
      }
    ],
    "tag": "VG7DWJBYB9"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/VG7DWJBYB9/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/VG7DWJBYB9.md",
  "msc": null,
  "name": "Hypercube graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/VG7/VG7DWJBYB9.md",
  "status": null,
  "tag": "VG7DWJBYB9",
  "uri": "m2://VG7DWJBYB9",
  "url": "https://math2.tamnd.com/wiki/hypercube-graph/",
  "writing": {
    "tag": "VG7DWJBYB9",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}