Category:Definitions/Adjacency (Graph Theory)
Jump to navigation
Jump to search
This category contains definitions related to adjacency in the context of graph theory.
Related results can be found in Category: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.
Pages in category "Definitions/Adjacency (Graph Theory)"
The following 21 pages are in this category, out of 21 total.
A
- Definition:Adjacent (Graph Theory)
- Definition:Adjacent (Graph Theory)/Also known as
- Definition:Adjacent (Graph Theory)/Edges
- Definition:Adjacent (Graph Theory)/Edges/Non-Adjacent
- Definition:Adjacent (Graph Theory)/Edges/Undirected Graph
- Definition:Adjacent (Graph Theory)/Faces
- Definition:Adjacent (Graph Theory)/Vertices
- Definition:Adjacent (Graph Theory)/Vertices/Digraph
- Definition:Adjacent (Graph Theory)/Vertices/Non-Adjacent
- Definition:Adjacent (Graph Theory)/Vertices/Undirected Graph
- Definition:Adjacent Edges (Undirected Graph)
- Definition:Adjacent Edges of Graph
- Definition:Adjacent Edges of Graph/Also known as
- Definition:Adjacent Faces of Graph
- Definition:Adjacent Vertices (Undirected Graph)
- Definition:Adjacent Vertices of Graph