MATH20902 2 hours

THE UNIVERSITY OF MANCHESTER

DISCRETE MATHEMATICS

26 May 2009 09:45 11:45

Answer ALL 3 questions in Section A (30 marks in all) and TWO of the 3 questions in Section B (25 marks each).

Electronic calculators may be used, provided that they cannot store text.

1 of 5

P.T.O.

MATH20902

SECTION A
Answer ALL 3 questions

A1. Explain what it means to say that a graph G is connected a graph G contains a cycle Prove that a connected graph on n vertices must have at least (n 1) edges. A2. Given a graph G(V, E ), say what is meant by the degree sequence of G the statement that G has an Eulerian cycle Suppose that G(V, E ) is a connected graph with n = |V | = 6 vertices and m = |E | = 13 edges: (a) List all the degree sequences that G could have. (b) Can G have an Eulerian cycle? Justify your answer. [10 marks] A3. Consider the following table, which lists the tasks required to complete a certain project, the time (in days) required to complete them and those tasks which are the immediate prerequisites. Task A B C D E F G Time 5 2 3 6 1 8 4 Prerequisites None A B A B&D B&D C, E & F [10 marks]

(a) Draw a suitable directed graph representing the project. (b) By nding a critical path through the graph from part (a), nd the shortest amount of time in which the project can be completed.

[10 marks]

2 of 5

P.T.O.

MATH20902

SECTION B
Answer 2 of the 3 questions

B4. (a) Explain what is meant by the notation x = [a0 : a1 , a2 , a3 ] and by the term simple continued fraction (SCF). (b) Characterize those real numbers that have repeating innite simple continued fraction representations of the form x = [3 : a, b, a, b, a, b, . . . ] and hence, or otherwise, nd the SCF for x = 12. (c) Find a rational approximation p/q for 12 such that q < 100 and 12 1 p < . q 1000

Now consider an innite sequence of positive integers a0 , a1 , . . . , aj , . . . and use it to dene two further sequences pj and qj according to the recursion relations p0 = a0 p1 = a0 a1 + 1 pj = aj pj 1 + pj 2 q0 = 1 q1 = a1 qj = aj qj 1 + qj 2

for j 2

for j 2

(B4.1)

(d) Prove that if pj and qj are as dened in (B4.1), then pj pj 1 (1)j +1 = qj qj 1 qj qj 1 holds for all j 1. [25 marks]

3 of 5

P.T.O.

MATH20902 B5. Consider the following graph G(V, E )

A B

(a) Dene a Hamiltonian cycle and nd one in the graph G above. (b) Explain how to construct the closure of a graph and sketch the closure [G] of the graph above, indicating which edges, if any, you have added. (c) State Kuratowskis Theorem. (d) Is the graph above planar? Explain why or why not. (e) What is the smallest number of edges that one can remove to convert the graph above into a planar one? Justify your answer by providing a planar diagram. [25 marks]

4 of 5

P.T.O.

MATH20902 B6. In a particularly friendly and up-to-date section of Manchesters Northern Quarter, the neighbours are trying to choose channels for their WiFi routers in such a way that they dont interfere with each other. If we label their ats with letters AG then the distances (in meters) between them are given by the table below. B C D E F G A B C D E F G 85 137 165 123 39 205 164 132 117 171 105 75 235 92 201 134 191 252 223 298 177

(a) Say what is meant by the terms a k -colouring of a graph G;

the chromatic number (G) of a graph G. (b) Suppose that good wireless reception requires that neighbours within 150 meters of each other should use dierent channels. What is the smallest number of channels that the neighbours can use? Justify your answer rigorously. (c) For a graph G(V, E ), say what is meant by a set of palettes for G;

a list colouring with respect to a set of palettes; the choosability ch(G). (d) Prove that if G(V, E ) is a graph on n vertices then (G) ch(G) n. [25 marks]

END OF EXAMINATION PAPER 5 of 5