Definition:Arborescence/Definition 4

Definition
Let $G = \struct {V, A}$ be a directed graph.

Let $r \in V$.

$G$ is an arborescence of root $r$ :


 * $(1): \quad$ Each vertex $v \ne r$ has exactly one predecessor
 * $(2): \quad$ $r$ has no predecessors
 * $(3): \quad$ For each $v \in V$ such that $v \ne r$ there is a path from $r$ to $v$.

Also see

 * Equivalence of Definitions of Arborescence