Definition:Edge (Graph Theory)

Definition

Let $G = \left({V, E}\right)$ be a graph.

The edges are the elements of $E$.

Informally, the edges are the lines that join the vertices together.

When $G$ is a digraph, the edges are usually called arcs.

If $e \in E$ is an edge joining the vertex $u$ to the vertex $v$, it is denoted $uv$.

$u$ and $v$ are called the endvertices of $e$.

Sources

• Gary Chartrand: Introductory Graph Theory (1977): $\S 1.3$