Definition:Arborescence/Root
Jump to navigation
Jump to search
Definition
Let $G = \struct {V, A}$ be a digraph.
Let $r \in V$.
Let $G$ be an arborescence of $r$.
The distinguished vertex $r$ of $G$ is known as the root of (the arborescence) $G$.
Sources
- 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation ... (previous) ... (next): Chapter $1$: Preliminaries: $1.2$ Graphs and Trees: Trees