Definition:Graph (Graph Theory)/Edge

From ProofWiki
Jump to navigation Jump to search


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

The edges are the elements of $E$.


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


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


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

Let $e = u v$ be an edge of $G$, that is, $e \in E$.

The endvertices of $e$ are the vertices $u$ and $v$.

Also see

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