Question

How many edges does a complete tournament graph with n vertices have?

a) n(n-1)/2
b) n-1
c) n
d) none of the above.

Answer 1

Answer on Question #38470 - Math - Graph Theory

A tournament graph is a directed graph obtained by assigning a direction for each edge in an undirected complete graph. Thus complete tournament graph has the same number of edges of complete undirected graph, i.e. $\frac{n(n-1)}{2}$.

ANSWER: A