OCR D1 2009 January — Question 2 2 marks

Exam BoardOCR
ModuleD1 (Decision Mathematics 1)
Year2009
SessionJanuary
Marks2
TopicGraph Theory Fundamentals
2
  1. Draw a graph with five vertices of orders 1, 2, 2, 3 and 4 .
  2. State whether the graph from part (i) is Eulerian, semi-Eulerian or neither. Explain how you know which it is.
  3. Explain why a graph with five vertices of orders \(1,2,2,3\) and 4 cannot be a tree.
This paper (4 questions)
View full paper
Q1 Q2 2 Q3 Q4 2