# Answer to Question #38470 in Discrete Mathematics for Sujata Roy

Question #38470

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.

a) n(n-1)/2

b) n-1

c) n

d) none of the above.

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

Assignment Expert31.01.14, 19:24Dear Sujata Roy.

You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!

Sujata Roy29.01.14, 20:30Thank you.

## Leave a comment