Solutions to Chapter 18 Exercises

in Discrete Mathematics by Norman L. Biggs;

2nd Edition 2002

18.1 Digraphs
18.1.1 In the adjacency list for a digraph we place y in column x whenever
(x, y) is an arc. Sketch the digraph whose adjacency list is
a b c d e f
d a b b f a
e c
e
Find a directed path from c to f , and a directed cycle starting and ending at d.
Solution
a b
path: c, b, a, d, e, f

cycle: d e f a d

f c

e d

169
 Solutions to Chapter 18 Exercises
in Discrete Mathematics by Norman L. Biggs;

2nd Edition 2002

18.1.2 In the following table, there is a + in row i and column j if i beats

j , and a if j beats i. Find a directed path containing all the vertices of the
tournament.

j
i 1 2 3 4 5 6 7 8 9
1 + + + +
2 + + +
3 + + +
4 + +
5 +
6 +
7 + +
8

Solution
1, 2, 4, 5, 6, 7, 8, 3, 9

170
 Solutions to Chapter 18 Exercises
in Discrete Mathematics by Norman L. Biggs;

2nd Edition 2002

18.2 Networks and critical paths

18.2.1 Calculate the latest times L(v) and the oat times F (u, v) for the project
described in the Example above. Find a critical path, and draw up a schedule
for the project showing the alternative start times for the activities which are
not critical.
Solution
v s p q r z t
E (v) 0 3 9 4 14 16
L(v) 0 3 9 5 14 16
Floats (s; v) (s; p) (r; z ) (r; q) (p; q) (q; z ) (z; t) (q; t)
1 0 3 1 0 0 0 2

Critical path s; p; q; z; t
Critical activities 2 ; 5 ; 6 ; 7

173
 Solutions to Chapter 18 Exercises
in Discrete Mathematics by Norman L. Biggs;

2nd Edition 2002

18.3 Flows and cuts

18.3.1 Find a ow f  in Fig. 18.3 for which val (f  ) = 10. Why is this the
maximum possible value?
Solution
a
5 6 3
5 3
2
4 b 2 d 4
s t
2 2 4
7 5
3
3 0 3
c

Arc: (s; a) (s; b) (s; c) (a; d) (b; d) (c; d) (a; t) (d; t) (c; t)
Flow: 5 2 3 2 2 0 3 4 3
Max ow since the cut fs; bg, fa; c; d; tg has capacity 10.

175
 Solutions to Chapter 18 Exercises
in Discrete Mathematics by Norman L. Biggs;

2nd Edition 2002

18.4 The max- ow min-cut theorem

18.4.1 The diagram (Fig. 18.5) represents a network, and the numbers on the
arcs are their capacities. A ow f is de ned as follows.
(x; y): (s; a) (s; b) (s; c) (a; b) (a; d) (b; c) (b; d) (b; e) (c; e) (d; t) (e; t)
f (x; y): 5 6 0 0 5 1 2 3 1 7 4
(i) What is the value of f ?
(ii) Find an f -augmenting path and compute the value of the augmented ow.
(iii) Find a cut with capacity 12.
(iv) What can you deduce?
a
10
5 d
4 3 9
6
s t
b 11
4
2 e
8
6
c
Fig. 18.5 A network, showing the capacity of each arc.

Solution
a
10
5
5 d
5 4
0 3 9
6 b 2 7
s t
6 11 4
2 3 4
18 1
0 6 e
1
c

(i) valf = 5 + 6 + 0 = 11 (= 7 + 4 check)

(ii) f { augmenting path is s; c; b; d; t

178
 8 2 3 9
s c b d t
0 1 2 7

augmentation 1, so value of augmented ow f  is 12.

(iii) A cut with capacity 12 is as shown:
fs; b; c; eg ; fa; d; tg
(iv) f  is max ow, val 12, cut is min cut, capacity 12.

179
 Solutions to Chapter 18 Exercises
in Discrete Mathematics by Norman L. Biggs;

2nd Edition 2002

18.5 The labelling algorithm for network ows

18.5.1 Starting from the zero ow, use the labelling algorithm (by hand!) to
nd the maximum ow in the network illustrated in Fig. 18.10.
a 10 c

50
10
40 20
15
s d t

30 15 45
50

b 20 e
Fig. 18.10 Find the maximum ow.
Solution
a 10 c

50
10
40 20
15
s d t

30 15 45
50

b 20 e

I 10 II
50 40
30 30
10 40

50 40 50 40

III IV
20 20
10
30 5 30

50 20 45 15

Tree IV does not reach t. Max ow = 55, min cut is (s; s), where
s = all vertices reached in IV , that is all except t.

181