jmaths
IB Mathematics: Applications and Interpretation HL · AHL 1: Graph Theory · AHL 1.10
Name Date
The Chinese postman problem Problem set B
Find the odd vertices first. Show the paths you compare and the repeated edges. No calculator is needed.
Each question matches the question with the same number in set A. Do the ones you got wrong there.
Difficulty: first skills applying them stretch
Skills
-
Answer these questions about the graph.
- (a) Write down the degree of each vertex and say which are odd.
- (b) Which edges must be repeated in a shortest Chinese postman route?
- (c) Find the length of the route.
-
A lifeguard must walk along every boardwalk on the beach shown, starting and finishing at A. The numbers are lengths in metres. Find the length of the shortest route and state which boardwalks are walked twice.
-
Look at the graph.
- (a) Write down the four odd vertices.
- (b) Compare the three pairings of the odd vertices. Use the shortest path for each pair.
- (c) State which edges are repeated and the length of the shortest route.
-
Write out a shortest route that begins and ends at A and uses every edge. State its length.
-
A ranger must walk along every trail of a forest, starting at the main gate A and finishing at the lookout hut B. The graph shows the trails, with lengths in km.
- (a) Find the length of the shortest route that starts at A, finishes at B and covers every edge.
- (b) The route must now finish where it started, at A. How much longer is the shortest route?
In context
-
A snow plough must clear every road shown and return to the garage at A. The numbers are lengths in km.
- (a) Find the length of the shortest route.
- (b) The vehicle travels at a steady 15 km/h. Find the time in minutes.
-
A cyclist wants to ride along every cycle path shown, starting and finishing at A. The numbers are lengths in km.
- (a) Compare the three ways of pairing the odd vertices and state which roads are repeated.
- (b) Find the length of the shortest route.
-
A museum cleaner must go along every gallery passage shown, starting and finishing at A. The numbers are lengths in metres. Find the shortest route, write it out and give its length.
Stretch
-
A new path of length 11 is built directly between C and D. Find the new length of the shortest route that covers every path and returns to the start. Is it shorter than before? Explain.
-
The weights on the graph are lengths.
- (a) Find the length of the shortest route that starts and finishes at A and covers every edge.
- (b) The route now starts and finishes at E. Does the length change? Give a reason.
jmaths.xyz · AI HL · AHL 1.10 The Chinese postman problem