For the following 3 and 4 a What is the score of each of the
For the following #3 and #4
a) What is the score of each of the vertices
b) Is it transitive? why or why not
c)Find two Hamiltonian paths in the tournament
Solution
3a) Score for each player is the number of wins or outgoing arrows.
a - 0, b - 1, c - 2, d - 3, e - 1
3b) Take c-> b and b -> a meaning c beats b and b beats a. From graph, c->a too. Transitive.
3c) DCBEA , CBDEA (each vertice has to be traversed exactly once for a Hamilton path)
4a) a - 2, b - 1, c- 4, d- 3, e - 0
4b) D->C, C->B => DB. Transitive
4c) CDABE
