{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nCube graph, the eight-vertex graph of the vertices and edges of a cube.\n\nHypercube graph, a higher-dimensional generalization of the cube graph.\n\nFolded cube graph, formed from a hypercube by adding a matching connecting opposite vertices.\n\nHalved cube graph, the half-square of a hypercube graph.\n\nPartial cube, a distance-preserving subgraph of a hypercube.\n\nThe cube of a graph $G$ is the graph power $G^{3}$.\n\nCubic graph, another name for a $3$-regular graph, one in which each vertex has three incident edges.\n\nCube-connected cycles, a cubic graph formed by replacing each vertex of a hypercube by a cycle.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "JZDNQ4RHKH"
    ],
    "kind": "concept",
    "name": "Cubic",
    "sources": [
      {
        "locator": "Glossary of graph theory, section C",
        "mention": "wikipedia://en/325802#ZLCA",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "N3YF6KPB8Z"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/N3YF6KPB8Z/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/N3YF6KPB8Z.md",
  "msc": null,
  "name": "Cubic",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/N3Y/N3YF6KPB8Z.md",
  "status": null,
  "tag": "N3YF6KPB8Z",
  "uri": "m2://N3YF6KPB8Z",
  "url": "https://math2.tamnd.com/wiki/cubic/",
  "writing": {
    "tag": "N3YF6KPB8Z",
    "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
      }
    ]
  }
}