Directed edge

In graph theory, a directed edge (or arc) ^[1][2] is an edge that connects an ordered pair of vertices, distinguishing a tail from a head. Directed edges are the defining feature of a directed graph, as opposed to the undirected edge of an undirected graph.

Definition

---

Definition 1 (Directed edge)

Let $G$ be a graph with vertex set $V$. A directed edge (or arc) is an ordered pair $(u,v)$ of vertices $u,v\in V$, where $u$ is called the tail and $v$ the head of the edge.

Notation

---

A directed edge from $u$ to $v$ is written $(u,v)$ or $u\to v$. Unlike the undirected edge $\{u,v\}$, order matters: $(u,v)\ne (v,u)$ unless $u=v$.

References

1. [1]

   “Directed graph”, Wikipedia, Available: https://en.wikipedia.org/wiki/Directed_graph, Accessed: 2026-07-14 ↩

2. [2]

   “Directed Graph”, Wolfram MathWorld, Available: https://mathworld.wolfram.com/DirectedGraph.html, Accessed: 2026-07-14 ↩