Team `A` and Team `B` have entered a chess competition.
Team `A` and `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?
 |
 |
|
|
|
 |
Networks, STD2 N2 2015 FUR1 5 MC
The graph below represents a friendship network. The vertices represent the four people in the friendship network: Kwan (K), Louise (L), Milly (M) and Narelle (N).
An edge represents the presence of a friendship between a pair of these people. For example, the edge connecting K and L shows that Kwan and Louise are friends.
Which one of the following graphs does not contain the same information.
