Question:

Figures (i) and (ii) represent intercity highway systems. The black dots represent
cities and the line segments between them represent intercity highways.
A salesperson needs to make a trip. She needs to start from a city, visit each of the
remaining cities exactly once, and finally return to the same city from which she
started.
Which one of the following options is then true?

Show Hint

Every city must have at least two highways for a closed once-each tour to exist; check whether any city in each figure has only one connecting highway.
Updated On: Jul 7, 2026
  • Such a trip is possible for (i), but not for (ii).
  • Such a trip is possible for (ii), but not for (i).
  • Such a trip is possible for both (i) and (ii).
  • Such a trip is possible neither for (i) nor for (ii).
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

Step 1: The salesperson's trip -- start at a city, visit every other city exactly once, and return to the start -- is exactly a Hamiltonian circuit on the highway graph.

Step 2: A necessary condition for a graph to contain a Hamiltonian circuit is that every vertex must have degree at least 2, because the circuit must enter and leave each city using two distinct edges.

Step 3: In figure (i), every city (vertex) has at least two highways (edges) connecting it to other cities, and the network is arranged so that a closed tour visiting every city exactly once can be traced -- so a Hamiltonian circuit exists for (i).

Step 4: In figure (ii), at least one city is connected to the rest of the network by only a single highway (a degree-1 vertex), so that city can be entered but not exited without reusing that same highway. Hence no Hamiltonian circuit exists for (ii).

Therefore the round trip is possible for (i) but not for (ii).

Final Answer: \(\boxed{A}\)

Was this answer helpful?
0
0