Category:Definitions/Digraphs
Jump to navigation
Jump to search
This category contains definitions related to Digraphs.
Related results can be found in Category:Digraphs.
A directed graph or digraph $D$ is a non-empty set $V$ together with an antireflexive relation $E$ on $V$.
Subcategories
This category has the following 5 subcategories, out of 5 total.
A
- Definitions/Arborescences (9 P)
- Definitions/Arcs of Digraphs (3 P)
L
- Definitions/Loop-Digraphs (4 P)
P
W
Pages in category "Definitions/Digraphs"
The following 41 pages are in this category, out of 41 total.
A
D
- Definition:Digraph
- Definition:Digraph/Also known as
- Definition:Digraph/Arc
- Definition:Digraph/Category-Theoretic Definition
- Definition:Digraph/Formal Definition
- Definition:Digraph/Simple Digraph
- Definition:Digraph/Symmetric Digraph
- Definition:Directed Graph
- Definition:Directed Hamilton Cycle Problem
- Definition:Directed Hamilton Cycle Problem/Decision Version
- Definition:Directed Hamilton Cycle Problem/Function Version
- Definition:Directed Walk