Category:Distance (Graph Theory)
Jump to navigation
Jump to search
This category contains results about distance in the context of graph theory.
Definitions specific to this category can be found in Definitions/Distance (Graph Theory).
Undirected Graph
Let $G = \tuple {V, E}$ be an undirected graph.
Let $u, v \in V$ be vertices of $V$.
The distance between $u$ and $v$ is the length of the shortest path from $u$ to $v$.
Digraph
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$.
This category currently contains no pages or media.