Definition:Graph (Graph Theory)/Edge

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

The edges are the elements of $E$.

In the above, the edges are $AB, AE, BE, CD, CE, CF, DE, DF, FG$.

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

If $G$ is an undirected graph, an edge $u v$ can equivalently be denoted $v u$.

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


 * Definition:Edge Set