An oriented graph is a directed graph obtained by giving each graph edge of a simple
graph one direction. Thus it has no loops and at
most one directed graph edge between any pair of distinct
vertices . An orientation of a complete
graph is a tournament .
The numbers of unlabeled oriented graphs on nodes are 1, 2,
7, 42, 582, ... (OEIS A001174 ).
The numbers of unlabeled oriented graphs that are weakly connected on nodes are 1, 1, 5, 34, 535, ... (OEIS A086345 ).
See also Cyclic Triple ,
Directed Graph ,
Seymour's Second
Neighborhood Conjecture ,
Simple Graph ,
Tournament ,
Transitive Triple ,
Undirected
Graph
Explore with Wolfram|Alpha
References Harary, F. "The Number of Oriented Graphs." Mich. Math. J. 4 , 221-224, 1957. Harary, F. Graph
Theory. 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 https://mathworld.wolfram.com/OrientedGraph.html
Subject classifications
, 2, ... nodes are 1, 2,
7, 42, 582, ... (OEIS A001174).
,
2, ... nodes are 1, 1, 5, 34, 535, ... (OEIS A086345).
