HANYURWIMFURA DAMIEN

LY2008033

COMPUTER SCIENCE AND TECHNOLOGY

DISCRETE MATHEMATICAL STRUCTURES ASSIGNMENT 7

2008/12/26
EXERCISE SET 6.1.

Q6 Draw a picture of the graph G   V , E ,   , where V   A, B, C .D, E , F , G , H  ,

E   e1 , e2 , , e9  and   e1    A, C ,   e2    A, B ,   e3    D, C ,   e4    B, D ,

  e5    E, A ,   e6    E , D ,   e7    F , E ,   e8    E , G and   e9    F , G

Solution:

A e1 C

e2 e3

e7 e5 B e4

F E e6 D

e9 eee e8

Q14. Give an example of a regular, connected graph on six vertices that is not complete.

Solution: The graph looks like this :

A B

F C

E D
HANYURWIMFURA DAMIEN

LY2008033

COMPUTER SCIENCE AND TECHNOLOGY

Q17. Let R={(1,1), (2,2), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (10,10), (11,11),
(12,12), (13,13), (14,14), (15,15), (16,16), (1,10), (10,1), (3,12), (12,3), (5,14), (14,5), (2,11),
(11,2), (4,13), (13,4), (6,15), (15,6), (7,16), (16,7), (8,9), (9,8)}. Draw the quotient graph G R.

Solution: {3, 12}

{4, 13}

{2, 11} {5, 14}

{1, 10} {6, 15}

{8, 9}

{7, 16}

EXERCISE SET 6.2

Q7. Use Fleury’s algorithm to produce an Euler circuit for the graph in this figure

Solution: One possible 2 3

answer 7

1 6 8 4

9 5
HANYURWIMFURA DAMIEN

LY2008033

COMPUTER SCIENCE AND TECHNOLOGY

Q10. At the door of an historical mansion, you receive a copy of the floor plan for the house. Is
it possible to visit every room in the house by passing through each door exactly once? Explain
your reasoning.

A B

F (outside)

Solution: Yes, it is possible to visit every room in the house by passing through each door
once. we see that the five rooms A, B, C, D, E and F have 2, 2, 2, 4, 2 and 4 doors (degrees)
respectively. Thus, the problem can be solved by Theorem 1, (b).

(If G is a connected graph and every vertex has even degree, then there is an Euler Circuit in
G)

The Euler circuit is: F, A, B, C, D, E, F.

Q13. In this exercise, no Euler circuit is possible for the graph given. For each graph, show the
minimum number of edges that would need to be traveled twice in order to travel every edge
and return to the starting vertex.

Solution: It is one possible solution. 14 10

13 11

15 12

51 50 43 35 28 27 26 25 16 17 9

1 48 49 44 42 34 36 29 30 24 18 8

47 45 41 37 31 23 19

46 40 38 33 32 22 20

2 39 4 5 21 7

3 6
HANYURWIMFURA DAMIEN

LY2008033

COMPUTER SCIENCE AND TECHNOLOGY

EXERCISE SET 6.3

Q12. Find a Hamiltonian circuit of minimal weight for the graph represented by the given
figure.

B 6 D 2 H

3 3 2 6

5 C 5 E

A 5 4 3

F 4 G

Solution: C, A, B, D, H, G, F, E, C