Clever Geek Handbook

Tournament schedule questions

Is the tournament schedule the same as a directed full graph? And, do all the vertices in the tournament graph have the same number of edges?

+1


source to share


1 answer


If I am missing something obvious, the answer to both questions is yes

The tournament schedule is defined as a complete schedule with the selected direction for the edges. Hence, it is a directed complete graph.

Wikipedia definition of tournament schedule



and since a complete graph has an edge between each vertex, each vertex has the same number of edges, and this does not change when the direction is chosen for the edge.

Wikipedia full schedule definition

+3


source






More articles:


All Articles