Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Return True if a graph is a tournament

Test whether a graph is a tournament:
| In[1]:= | ![]() |
| Out[1]= |
Test whether a larger graph is a tournament:
| In[2]:= |
| Out[2]= | ![]() |
| In[3]:= |
| Out[3]= |
Works with undirected graphs:
| In[4]:= | ![]() |
| Out[4]= |
Directed graphs:
| In[5]:= | ![]() |
| Out[5]= |
Weighted graphs:
| In[6]:= | ![]() |
| Out[6]= |
Multigraphs:
| In[7]:= | ![]() |
| Out[7]= |
Mixed graphs:
| In[8]:= | ![]() |
| Out[8]= |
A non-tournament graph:
| In[9]:= |
| Out[9]= | ![]() |
The UndirectedGraph function makes this into a complete graph, a necessary condition for a tournament, but it has too many edges:
| In[10]:= |
| Out[10]= |
| In[11]:= |
| Out[11]= |
Wolfram Language 13.0 (December 2021) or above
This work is licensed under a Creative Commons Attribution 4.0 International License