\begin{definition}[Definition:Incident (Graph Theory)/Undirected Graph]
Let $G = \struct {V, E}$ be an undirected graph.
Let $u, v \in V$ be vertices of $G$.
Let $e = \set {u, v} \in E$ be an edge of $G$:
:320px
Then:
:$u$ and $v$ are each '''incident with $e$'''
:$e$ is '''incident with $u$''' and '''incident with $v$'''.
\end{definition}