Beruflich Dokumente
Kultur Dokumente
Solutions to Quiz 2
MATH2069/2969: Discrete Mathematics and Graph Theory
Semester 1, 2013
Name:
SID:
MATH2069
MATH2969
Answers must be written in pen in the boxes provided. Anything written in pencil or
written outside the boxes will not be marked.
uses every edge exactly once and returns to its starting point.
(c) Let G be a connected graph with n ! 3 vertices. Ores Theorem states that
G is Hamiltonian if
every non-adjacent pair of vertices v, w satisfies deg(v) + deg(w) ! n.
(d) The distance d(v, w) between two vertices v and w in a connected weighted
graph is
the minimum weight of a walk from v to w.
(5 marks)
V = {1, 2, . . . , 10} is
(b) The number of graphs with the vertex set
!45"
15
V = {1, 2, . . . , 10} is
(d) The number of isomorphism classes of graphs
with two edges is
15
(5 marks)
3. For each of the following sequences, say whether it is graphic or not graphic.
(a) (3, 3, 4, 5, 5, 5, 7)
not graphic
(b) (3, 3, 3, 5, 5, 5, 5, 5, 5)
not graphic
(c) (2, 2, 2, 4, 4, 4, 4, 4)
graphic
(d) (1, 1, 2, 2, 4, 5, 5)
not graphic
(4 marks)
d
g
yes
(e) Is G Hamiltonian?
no
9
(6 marks)
b
9
d
9
64
35
19
(3 marks)
6. The Pr
ufer sequence of a tree with the vertices {1, 2, 3, 4, 5, 6, 7} is (2, 5, 2, 5, 2).
Then the degree sequence of the tree is
(1, 1, 1, 1, 1, 3, 4)
(1 mark)
4
6
5
3
(1 mark)
END OF QUIZ.