{
  "aliases": [
    "k-leaf-power"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical area of graph theory, a **$k$-leaf power** of a [[tree|062D9KXJB1]] $T$ is a [[graph|00C0BR7D7H]] $G$ whose vertices are the leaves of $T$ and whose edges connect pairs of leaves whose [[distance|0QV9VNNB4Z]] in $T$ is at most $k$. That is, $G$ is an [[induced subgraph|0EREPBVG2G]] of the graph power $T^k$, induced by the leaves of $T$. For a graph $G$ constructed in this way, $T$ is called a **$k$-leaf root** of $G$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "k-leaf-power"
    ],
    "inventory": [
      "2EWZ6TRXF4"
    ],
    "kind": "concept",
    "name": "Leaf power",
    "same_as": {
      "wikidata": "Q25304867",
      "wikipedia": "Leaf power"
    },
    "sources": [
      {
        "locator": "Leaf power",
        "mention": "wikipedia://en/49639194",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:49639194@r1373953278"
      }
    ],
    "tag": "5W1JJE438R"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/5W1JJE438R/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/5W1JJE438R.md",
  "msc": null,
  "name": "Leaf power",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/5W1/5W1JJE438R.md",
  "status": null,
  "tag": "5W1JJE438R",
  "uri": "m2://5W1JJE438R",
  "url": "https://math2.tamnd.com/wiki/leaf-power/",
  "writing": {
    "tag": "5W1JJE438R",
    "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
      }
    ]
  }
}