Question:
Prove that every regular tournament is strong.
Here we need to first figure out something more about outdegrees and indegrees and orders of regular digraphs. Try to find a regular digraps with 3, 4, 5 ,6 vertices, and generalize.
D is a regular tournament if there is k such that outdegree x = k and indegree x = n-k-1 for every x in D.
Please can you explain what does regular tournament strong mean?
Can you give a graph or graphs.
Explain this problem step by step.