Definition:Distance (Graph Theory)/Undirected Graph

Definition

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$.

Also see

• Results about distance in the context of graph theory can be found here.

Sources

There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page.