quiz02bs - The University of Sydney School of Mathematics...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
The University of Sydney School of Mathematics and Statistics Solutions to Quiz 2 MATH2069/2969: Discrete Mathematics and Graph Theory Semester 1, 2009 Name: SID: Enrolled in (please circle): MATH2069 MATH2969 This quiz lasts 30 minutes. There are a total of 30 marks. Note that the true/false parts of question 7 are worth half a mark each. Answers must be written in pen in the boxes provided. Anything written in pencil or written outside the boxes will not be marked.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
1. Complete the following deFnitions. (a) If v and w are vertices of a graph G , we say that v is linked to w in G if there is a walk from v to w in G . (b) If v is a vertex of a graph G , the degree deg( v ) is the number of edges ending at v . (c) A connected graph with 3 vertices is Hamiltonian if it has a walk which returns to its starting vertex and visits every vertex exactly once. (d) In a connected weighted graph, the Chinese Postman Problem is to Fnd a walk which has minimal weight subject to the following constraints: it must
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 03/20/2011.

Page1 / 6

quiz02bs - The University of Sydney School of Mathematics...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online