Question

Team A and Team B have entered a chess competition.Team A and Team B have three members each. Each member of Team A must play each member of Team B once. Which of the following network diagrams could represent the chess games to be played?

Answer 1

There are three memners in each of team A and team B. So each player can play with three players of opposite team. This means each vertex of tree diagram has 3 degree.

From the given options, it can be observed that tree diagram in option B represents that each vetex has three degrees.

So answer is option B.