Definition:Adjacent (Graph Theory)/Edges/Undirected Graph

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

Two edges $e_1, e_2 \in E$ of $G$ adjacent there exists a vertex $v \in V$ to which they are both incident.

Otherwise they are non-adjacent.

Also known as
Adjacent edges can also be described as neighboring (British English spelling: neighbouring).