Category:Digraphs

From ProofWiki

Jump to navigation Jump to search

This category contains results about Digraphs.
Definitions specific to this category can be found in Definitions/Digraphs.

A directed graph or digraph $D$ is a non-empty set $V$ together with an antireflexive relation $E$ on $V$.

The elements of $E$ are the arcs.

Subcategories

This category has the following 6 subcategories, out of 6 total.

A

Arborescences‎ (1 C, 1 P)
Arcs of Digraphs‎ (empty)

E

Examples of Digraphs‎ (2 P)

L

Loop-Digraphs‎ (1 P)

M

Maximum Number of Arcs in Digraph‎ (5 P)

P

Paths in Digraphs‎ (1 C)

Pages in category "Digraphs"

The following 3 pages are in this category, out of 3 total.

E

M

Maximum Number of Arcs in Digraph

Retrieved from "https://proofwiki.org/w/index.php?title=Category:Digraphs&oldid=331991"

Graph Theory