|
GraphTheory[IsTournament]
|
|
Calling Sequence
|
|
IsTournament(G)
|
|
|
Description
|
|
|
•
|
IsTournament returns true if the input graph is a tournament. It returns false otherwise.
|
|
•
|
A tournament is a directed graph G that satisfies the following property: for every pair of vertices u and v in G exactly one of the directed edges ![[u, v]](/support/helpjp/helpview.aspx?si=6090/file01845/math50.png) or ![[v, u]](/support/helpjp/helpview.aspx?si=6090/file01845/math52.png) is in G.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
![T1 := Digraph({[1, 2], [2, 3], [3, 1]})](/support/helpjp/helpview.aspx?si=6090/file01845/math67.png)
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
![T2 := Digraph({[1, 2], [1, 3], [2, 3], [3, 1]})](/support/helpjp/helpview.aspx?si=6090/file01845/math81.png)
|
|
| (3) |
|
>
|
|
|
| (4) |
|
>
|
![T3 := Digraph({[1, 2], [2, 3]})](/support/helpjp/helpview.aspx?si=6090/file01845/math95.png)
|
|
| (5) |
|
>
|
|
|
| (6) |
|
|
Download Help Document
Was this information helpful?
