There are 5 cities, A, B, C, D and E connected by 7 roads as shown in the figure below:
Design a route such that you start from any city of your choice and walk on each of the 7 roads once and only once, not necessarily returning to the city from which you started.
For a route that satisfies the above restrictions, which of the following statements is true?
We can start from either city C or D.
C - A - B - D - C - B - E - D
D - B - A - C - B - E - D - C
We cannot start from any other city.
So, we can either start from C or end at C but not both.
Create a FREE account and get: