A connected network has vertices of odd degree and all its other vertices have even degree. What is the smallest number of separate trails that together travel along every edge exactly once?
Worked solution
Each trail starts at one odd vertex and ends at another odd vertex, so it uses up two odd vertices
Number of trails
Answer
Marking guidelines
States that each trail uses up two odd vertices | 1 mark |
Divides to find the number of trails | 1 mark |
Report a problem with this question.
