{
  "aliases": [
    "arboreal-decomposition",
    "directed-rooted-tree",
    "rooted-directed-tree"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, an **arborescence** is a [[directed graph|0KFYGSHHF5]] where there exists a vertex $r$ (called the *root*) such that, for any other vertex $v$, there is exactly one [[directed walk|03NAMV1DHJ]] from $r$ to $v$ (noting that the root $r$ is unique). An arborescence is thus the directed-graph form of a rooted tree, understood here as an undirected graph. An arborescence is also a directed rooted [[tree|062D9KXJB1]] in which all edges point away from the root; a number of other equivalent characterizations exist.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "arboreal-decomposition",
      "directed-rooted-tree",
      "rooted-directed-tree"
    ],
    "inventory": [
      "F10P5CYGAM"
    ],
    "kind": "concept",
    "name": "Arborescence (graph theory)",
    "same_as": {
      "wikidata": "Q1520825",
      "wikipedia": "Arborescence (graph theory)"
    },
    "sources": [
      {
        "locator": "Arborescence (graph theory)",
        "mention": "wikipedia://en/13251077",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:13251077@r1369107778"
      }
    ],
    "tag": "FT0SRH8HZD"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/FT0SRH8HZD/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/FT0SRH8HZD.md",
  "msc": null,
  "name": "Arborescence (graph theory)",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/FT0/FT0SRH8HZD.md",
  "status": null,
  "tag": "FT0SRH8HZD",
  "uri": "m2://FT0SRH8HZD",
  "url": "https://math2.tamnd.com/wiki/arborescence-graph-theory/",
  "writing": {
    "tag": "FT0SRH8HZD",
    "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
      }
    ]
  }
}