Arborescence (nonfiction)

In graph theory, an arborescence is a directed graph in which, for a vertex u called the root and any other vertex v, there is exactly one directed path from u to v.

An arborescence is thus the directed-graph form of a rooted tree, understood here as an undirected graph.

Fiction cross-reference

• Crimes against mathematical constants
• Gnomon algorithm
• Mathematics

Nonfiction cross-reference

• Graph theory (nonfiction)
• Mathematics (nonfiction)

External links:

• Arborescence (graph theory) @ Wikipedia