MATH260 2002/2003

Assignment 7
All answers must be justified. Show your work.
1. (1 pt) 7.3 #6 Represent the graph in Exercise 2 with an adjacency matrix.
Solution:

0
1
0
1
0

1
0
0
1
1

0
0
0
1
1

1
1
1
0
0

0
1
1
0
0

2. (1 pt) 7.3 #12 Draw a graph with the given adjacency matrix.

1 1 1 0
0 0 1 0

1 0 1 0
1 1 1 0
Solution:

3. (2 pts) 7.3 #38 Determine whether the given pair of graphs is isomorphic.
Solution: They are isomorphic. An isomorphism is:
f (u1 ) = v1
f (u2 ) = v3
f (u3 ) = v2
f (u4 ) = v5
f (u5 ) = v4

4. (2 pts)7.3 #42 Determine whether the given pair of graphs is isomorphic.

Solution: They are not. One way to see that is that the two vertices of degree four in the first graph
(u2 , u3 ) are adjacent and the two vertices of degree four in the second graph (v2 , v4 ) are not adjacent.

5. (3 pts) 7.3 #58 Determine whether the graphs without loops with the following incidence matrices
are isomorphic.
1

(a)

1 0 1
1 1 0
0 1 1 , 1 0 1
1 1 0
0 1 1

Solution: Both graphs are K3 . They are isomorphic.

(b)

1
1

0
0

1
0
0
1

0
1
0
1

0
0 1
0 1
1
,
1 1 0
0
1 0

0
0
1
1

0
1
0
1

0
1
1
0

1
0

0
1

Solution: Both graphs are K4 with one edge missing. They are isomorphic.

6. (3 pts) 7.4 #10 (Use Theorem 2) Find the number of paths between c and d in the graph in Figure 1
of length
a) 2.

b) 3.

c) 4.

d) 5.

e) 6.

Solution: Let A be the adjacency matrix of G where

0 1 0
1 0 1

0 1 0
A=
1 0 1

1 1 0
0 1 1

3 1 2
1 4 1

2 1 3
2
A =
1 3 0

2 2 3
2 2 1

4 9 4
9 6 9

4 9 2
A3 =
7 4 8

7 10 4
5 7 7

23 20 21
20 35 17

21 17 24
4
A =
15 28 10

25 26 28
20 25 15
2

f) 7.

the vertices are arranged in the alphabet order.

1 1 0
0 1 1

1 0 1

0 1 0

1 0 1
0 1 0

1 2 2
3 2 2

0 3 1

3 1 2

1 4 1
2 1 3

7 7 5
4 10 7

8 4 7

2 9 4

9 6 9
4 9 4

15 25 20
28 26 25

10 28 15

24 17 21

17 35 20
21 20 23

5
A =

A6 =

A7 =

60 89 55
89 88 88
55 88 42
69 63 73
78 108 63
66 78 69

236
259
224
193
284
222

259
363
229
285
318
284

224
229
230
160
285
193

69 78 66
63 108 78

73 63 69

42 88 55

88 88 89
55 89 60

193
285
160
230
229
224

284
318
285
229
363
259

222
284
193
224
259
236

736 966 674 744 910 767

966 1090 932 806 1191 910
674 932 582 739 806 744
744 806 739 582 932 674
910 1191 806 932 1090 966
767 910 744 674 966 736

The number of paths from c to d is the entry in the third row and fourth column. The answers are (a)
0; (b) 8; (c) 10; (d) 73; (e) 160; (f) 739.

7. (3 pts) 7.4 #18 Find all the cut edges in the graphs in Exercises 15-17.

Solution: 15. None. 16. cd. 17. ab, bc, cd, ce, ei, ih.

8. (2 pts) 7.4 #34 Use Theorem 2 to find the length of the shortest path from a to c in the directed

graph in Exercise 2.

Solution: The adjacency matrix is

A =

0
1
0
1
0

1
0
1
0
0

0
0
0
0
1

1
0
0
0
1

0
1
0
0
0

2
0
1
0
1

0
1
0
1
1

0
1
0
0
0

0
2
0
1
0

1
0
1
0
0

0
3
0
2
1

2
1
1
0
1

1
0
1
0
0

3
0
2
0
1

0
1
0
1
1

Since the entries in row 1 and column 3 is zero in A and A2 but 1 in A3 , there is no path of length 1
or 2 from a to c. There is one path of length three from a to c. Therefore, the shortest path from a to
c has length 3.

9. (1 pt) 7.5 #4 Determine whether each graph has an Euler circuit. Construct such a circuit when one
exists.

Solution: Since both f and c have degree three, there is no Euler circuit.

10. (1 pt) 7.5 #12 Determine whether the graph in Exercise 5 has an Euler path. Construct such a path

if it exists.

Solution: Every vertex has an even degree. There are Euler circuits. One of them is aeaebedcecdba.
11. (1 pt) 7.5 #20 Determine whether the picture shown can be drawn with a pencil in a continuous
motion without lifting the pencil or retracing part of the picture.

Solution: Yes. Since every vertex except two has even degree, the graph has an Euler path.

12. (3 pts) 7.5 #36 For which values of n do the following graphs have an Euler circuit
a) Kn b) Cn c) Wn d) Qn .
Solution: (a) Every vertex in Kn has degree n 1. Kn has an Euler circuit if n is odd.
(b) Every vertex in Cn has degree two. Cn has an Euler circuit for every n.

(c) Every vertex except the center of Wn has degree three. Wn has an Euler circuit for no n.
(d) Every vertex in Qn has degree n. Qn has an Euler circuit if n is even.

13. (1 pt) 7.5 #42 Determine whether the given graph has a Hamilton circuit. If it does, find such a
circuit. If it does not, give an argument to show why no such circuit exists.

Solution: A Hamilton circuit does not exist since f has degree 1.

14. (2 pts) 7.5 #44 Determine whether the given graph has a Hamilton circuit. If it does, find such a
circuit. If it does not, give an argument to show why no such circuit exists.

Solution: Suppose that there is a Hamilton circuit. Then the edges ab, da must be in the circuit for a
to be in the circuit. Similarly, the edges bc, ch, hg, gf, fe, ed all have to be in the circuit. But these
edges form a circuit already. Therefore, a Hamilton circuit cannot exist.

15. (1 pt) 7.5 #46 Determine whether the given graph has a Hamilton circuit. If it does, find such a
circuit. If it does not, give an argument to show why no such circuit exists.

Solution: There are Hamilton circuits. For example, a, b, c, e, f, i, h, g, d, a.

16. (2 pts) 7.6 #2 Find the length of the shortest path between a and z in the given weighted graph.

Solution:
a
b
c
e
d
z

a
0
0
0
0
0
0

b
2
2
2
2
2
2

c
3
3
3
3
3
3

7
7
5
5
5

4
4
4
4
4

8
7
7

The shortest distance from a to z is 7.

17. (4 pts) 7.6 #4 Find the length of the shortest path between a and z in the given weighted graph.

a
d
b
e
c
g
f
h
k
l
i
r
j
m
n
p
q
o
t
s
z

a
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

Solution:
b c
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4
2 4

d
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3

6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6

5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5

6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6

8
8
8
8
8
8
8
8
8
8
8
8
8
8
8

10
10
10
10
10
10
10
10
10
10
10
10
10
10
10

7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7

7
7
7
7
7
7
7
7
7
7
7
7
7
7

10
10
10
10
10
10
10
10
10
10
10
10

11
11
11
10
10
10
10
10
10
10
10
10
10

14
14
13
13
13
13
13
13
13
13
13
13
13
13

12
12
12
12
12
12
12
12

The shortest path from a to z is a, b, e, h, l, m, p, s, z and the length is 16.

17
17
17
12
12
12
12
12
12
12

9
9
9
9
9
9
9
9
9
9
9
9
9

14
14
14
14
14
14

14
14
14
14
13
13
13
13
13
13

21
16
16

18. (1 pt) 7.7 #10 Suppose that a connected planar graph has eight vertices, each of degree 3. Into how
many regions is the plane divided by a planar representation of this graph?
Solution: Since each vertex has degree 3 and 2e = the sum of the degrees = 24. We have e = 12.
Eulers formula, we have
8 + r 12 = 2.
7

Therefore, r = 6.

19. (1 pt) 7.7 #12 Suppose that a connected planar graph has 30 edges. If a planar representation of this
graph divides the plane into 20 regions, how many vertices does this graph have?
Solution: Since e = 30 and r = 20, by Eulers formula, we have
v + 20 30 = 2.
Therefore, v = 12.

20. (2 pts) 7.7 #14 Suppose that a connected bipartite planar simple graph has e edges and v vertices.
Show that e 2v 4 if v 3.
Solution: In a bipartite planar simple graph, the smallest region would have at least 4 edges in its
boundary. Since every edge can be used in the boundaries of two regions, we have
e
4r 2e r
2
Substituting this into Eulers formula, we have
e
v+ e 2
2
e
v2
2
Therefore e 2v 4.

21. (2 pts) 7.8 #6 Find the chromatic number of the given graph.

Solution: Since there are many triangles in G, the chromatic number of G is at least 3. G can be
coloured with three colours:
vertex a b c d e f
colour 1 2 2 3 3 1
The chromatic number of G is 3.

22. (3 pts) 7.8 #8 Find the chromatic number of the given graph.

Solution: Since the vertices i, b, c, h form a K4 , the chromatic number of G is at least 4. G can be
coloured with four colours:
vertex
colour

a
3

b
2

c
3

d
2

e
3

f
2

g
1

h
4

i
1

The chromatic number of G is four.

23. (3 pts) 7.8 #16 How many dierent channels are needed for six stations located at the distances shown
in the table, if two stations cannot use the same channel when they are within 150 miles of each other?
1

85
175
200
50
100

1
2
3
4
5
6

2
85

125
175
100
160

3
175
125

100
200
250

4
200
175
100

210
220

5
50
100
200
210

100

6
100
160
250
220
100

Solution: We construct a graph G. The vertices of G are the stations. Two vertices are adjacent if the
stations are within 150 miles of each other. The adjacency matrix of G is

0 1 0 0 1 1
1 0 1 0 1 0

0 1 0 1 0 0

0 0 1 0 0 0

1 1 0 0 0 1
1 0 0 0 1 0
The graph is

It is easy to check that the chromatic number of G is 3. Therefore at least three channels are needed.