OCR D1 2006 June — Question 2

Exam BoardOCR
ModuleD1 (Decision Mathematics 1)
Year2006
SessionJune
TopicPermutations & Arrangements
TypeAssignment/allocation matching problems
2
  1. Draw three mathematically different graphs, labelled graph \(A\), graph \(B\) and graph \(C\), each with four vertices, of orders 1, 3, 3 and 3, and five arcs.
  2. Explain how you know that none of the graphs from part (i) is Eulerian.
This paper (7 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6 Q12