Oriented Graph

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).

See also

Cyclic Triple, Directed Graph, Simple Graph, Tournament, Transitive Triple, Undirected Graph

Explore with Wolfram|Alpha


Harary, F. "The Number of Oriented Graphs." Mich. Math. J. 4, 221-224, 1957.Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 10, 1994.Sloane, N. J. A. Sequences A001174/M1809 and A086345 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Oriented Graph

Cite this as:

Weisstein, Eric W. "Oriented Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications