Is a tournament graph the same thing as a directed complete graph? And, do all vertices in a tournament graph have the same number of edges?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Is a tournament graph the same thing as a directed complete graph? And, do all vertices in a tournament graph have the same number of edges?
Unless I’m missing something obvious then the answer to both your questions is ‘yes’
A tournament graph is defined as a complete graph with a direction chosen for the edges. Hence it is a directed complete graph.
Wikipedia definition of a Tournament Graph
and since a complete graph has an edge between each vertex, then every vertex has the same number of edges, and this doesn’t change when a direction is chosen for the edge.
Wikipedia definition of a Complete Graph