IB Mathematics AHL 3.16 Walks, trails, paths, circuits, cycles AI HL Paper 1- Exam Style Questions- New Syllabus
The weights on the following graph represent the lengths of different roads in kilometres.
The total length of the roads is \( 33 + x \, \text{km} \).
(a) Write down the vertices with odd degree.
(b) Find two expressions, in terms of \( x \), for the shortest distance required to walk along all of the paths, beginning and ending at the same vertex. Include in your answer the interval of values of \( x \) for which each expression is valid.
▶️ Answer/Explanation
(a)
B and C
The degree of a vertex is the number of edges incident to it. Vertices B and C have odd degree, implying others (A, D, E, F, G, H) are even in context.
Result: Vertices B and C [2]
(b)
For \( x \leq 5 \): \( 33 + 2x \)
For \( x \geq 5 \): \( 38 + x \)
Total road length is \( 33 + x \, \text{km} \). Repeat edge BC (length \( x \)) for \( 33 + 2x \), or repeat path B-A-C (length 5) for \( 38 + x \). Intervals determined by \( 33 + 2x = 38 + x \), so \( x = 5 \).
Result: \( 33 + 2x \) for \( x \leq 5 \), \( 38 + x \) for \( x \geq 5 \) [3]