A digraph D is an arborescence if there is a distinguished node x (called the root) and for every node y different from x there is exactly one elementary path from x to y.

--back to combinatorics--

Ar`bo*res"cence (#), n.

The state of being arborescent; the resemblance to a tree in minerals, or crystallizations, or groups of crystals in that form; as, the arborescence produced by precipitating silver.

 

© Webster 1913.