Question 27
A chess tournament is conducted for n players. Each player plays with every other player d times. The result of each match is either a win or loss. The results are stored in a list chess. Each match where player i beats j is recorded as a list (pair) [i, j] in chess. Based on the above data, answer the given subquestions.
Choose the correct statement(s) about graph G. It is a Multiple Select Question.
G is an undirected graph
For each vertex i in G, in-degree and out-degree are the same
For each pair of vertices i and j in G, M[i][j] <= d
G is always acyclic