Definition:Adjacent (Graph Theory)/Edges/Undirected Graph
Jump to navigation
Jump to search
Definition
Let $G = \struct {V, E}$ be an undirected graph.
Two edges $e_1, e_2 \in E$ of $G$ adjacent if and only if there exists a vertex $v \in V$ to which they are both incident.
Otherwise they are non-adjacent.
Also known as
Adjacent elements of a graph can also be described as neighboring (British English spelling: neighbouring).
Also see
- Results about adjacency in the context of graph theory can be found here.
Sources
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): Chapter $1$: Mathematical Models: $\S 1.3$: Graphs