Tournament Play The directed graph in Fig. 3.1.7 is called a tournament graph because every node is connected to every other node exactly once. The nodes represent players, and an arc from node i to node j stands for the fact that player i has beaten player j. Compute the adjacency matrix T of this tournament graph and rank the players by direct and indirect dominance.
Look at the meaning of T2 and T + T2.

Figure 3.1.7 Tournament graph
(Problem 93)

Transcribed Image Text:

2 4 5 3.