Tournament (graph theory)

A tournament graph or tournament is a directed graph in which between any two distinct vertices x, y there is exactly one edge - that is, either an edge from x to y or from y to x ( but not both). In addition, should an edge ( x, x) exist for any of its nodes x.

Formalized definition

A tournament graph is a directed graph that satisfies the following conditions:

• Applies to all with or,
• Applies to all with or,
• Applies to all.

Properties

Each non-empty finite tournament graph contains a Hamilton path.

• Directed graph