# Definition:Orientation (Graph Theory)

Jump to navigation
Jump to search

## Definition

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

Let $H = \struct {V, A}$ be a directed graph.

Then $H$ is an **orientation** of $G$ if and only if both of the following hold:

- $G$ is a simple digraph. That is, $A$ is antisymmetric.
- $\forall x, y \in V: \paren {\set {x, y} \in E \iff \tuple {x, y} \in A \lor \tuple {y, x} \in A}$

## Also see

Note that every simple digraph is an **orientation** of exactly one simple graph, but a simple graph may have more than one **orientation**.