complete oriented graph | oriented tree

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n = 1, 2, ... nodes are 1, 2, 7, 42, 582, ... (OEIS A001174). The numbers of connected oriented graphs on n = 1, 2, ... nodes are 1, 1, 5, 34, 535 ... (OEIS A086345).

cyclic triple | directed graph | simple graph | tournament | transitive triple | undirected graph