Examiner's comment
This question required both accurate technical knowledge of the topic and good communication skills. Many candidates demonstrated one or the other, but not both. In part (a) some candidates did give the simplest answer, that a graph cannot have an odd number of odd nodes. However, many candidates opted to sum the degrees and then struggled to convey why 21 was impossible. It was quite common to see true statements, which failed to answer the question, for example “the sum of the degrees must be even” but with no supporting working relating to the question. Euler’s Handshaking Lemma was popular with candidates but not always quoted in a relevant fashion. A common misconception was that, as there were six nodes, no node could have a degree of more than five and some stated that the sum of the degrees could not exceed 12. Part (b) was slightly better answered than part (a), although not all candidates knew that the nodes of a Eulerian graph are all even. Some of those who did so, correctly answered by simply stating that the node of order 1 is odd. Others wasted time considering which of the four expressions in x would be odd or even, depending on whether x was an odd or even number.