---
tag: 5W1JJE438R
kind: concept
name: Leaf power
aliases: [k-leaf-power]
sources:
  - wikipedia: en:49639194@r1373953278
    locator: Leaf power
    note: adopted
    mention: wikipedia://en/49639194
    sections: [Summary]
same_as:
  wikidata: Q25304867
  wikipedia: Leaf power
inventory: [2EWZ6TRXF4]
---

## Summary

In 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$.