{
  "aliases": [
    "power-of-graph",
    "square-of-a-graph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a branch of mathematics, the **$k$th power** $G^{k}$ of an undirected graph $G$ is another graph that has the same set of vertices, but in which two vertices are adjacent when their [[distance|0QV9VNNB4Z]] in $G$ is at most $k$. Powers of graphs are referred to using terminology similar to that of exponentiation of numbers: $G^{2}$ is called the *square* of $G$, $G^{3}$ is called the *cube* of $G$, etc.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "power-of-graph",
      "square-of-a-graph"
    ],
    "inventory": [
      "CXXDTBCNNB"
    ],
    "kind": "concept",
    "name": "Graph power",
    "same_as": {
      "wikidata": "Q5597091",
      "wikipedia": "Graph power"
    },
    "sources": [
      {
        "locator": "Graph power",
        "mention": "wikipedia://en/38618878",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:38618878@r1335625130"
      }
    ],
    "tag": "CKJPP0VAZD"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/CKJPP0VAZD/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/CKJPP0VAZD.md",
  "msc": null,
  "name": "Graph power",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/CKJ/CKJPP0VAZD.md",
  "status": null,
  "tag": "CKJPP0VAZD",
  "uri": "m2://CKJPP0VAZD",
  "url": "https://math2.tamnd.com/wiki/graph-power/",
  "writing": {
    "tag": "CKJPP0VAZD",
    "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
      }
    ]
  }
}