(idea) by artemis entreri Thu Dec 28 2000 at 15:01:45
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--
I like it!
(definition) by Webster 1913 Tue Dec 21 1999 at 21:52:49

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.

I like it! 2 C!s

Log in or register to write something here or to contact authors.