Definition:Distance (Graph Theory)/Directed Graph
Jump to navigation
Jump to search
Definition
Let $G = \tuple {V, E}$ be a digraph.
Let $u, v \in V$ be vertices of $V$.
The distance from $u$ to $v$ is the length of the shortest path from $u$ to $v$.
Also see
- Results about distance in the context of graph theory can be found here.
Sources
- 1977: Gary Chartrand: Introductory Graph Theory: Chapter $7$: Digraphs and Mathematical Models: $7.2$: Tournaments