Category:Adjacency (Graph Theory)
Jump to navigation
Jump to search
This category contains results about adjacency in the context of graph theory.
Definitions specific to this category can be found in Definitions/Adjacency (Graph Theory).
Let $G = \struct {V, E}$ be an undirected graph.
Two vertices $u, v \in V$ of $G$ are adjacent if and only if there exists an edge $e = \set {u, v} \in E$ of $G$ to which they are both incident.
This category currently contains no pages or media.