Definition:Graph (Graph Theory)/Edge/Join

Definition

Let $G = \struct {V, E}$ be a graph.

Let $u$ and $v$ be vertices of $G$.

Let $e = u v$ be an edge of $G$.

Then $e$ joins the vertices $u$ and $v$.

Also see

• Definition:Incident (Graph Theory)

Sources

• 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): Chapter $1$: Mathematical Models: $\S 1.3$: Graphs