Graph Theory: Visiting Cities
XAT 2011 · Quantitative Ability & Data Interpretation · Hard · Graph Theory
In the country of Twenty, there are exactly twenty cities, and there is exactly one direct road between any two cities. No two direct roads have an overlapping road segment. After the election dates are announced, candidates from their respective cities start visiting the other cities. Following are the rules that the election commission has laid down for the candidates:
- Each candidate must visit each of the other cities exactly once.
- Each candidate must use only the direct roads between two cities for going from one city to another.
- The candidate must return to his own city at the end of the campaign.
- No direct road between two cities would be used by more than one candidate.
The maximum possible number of candidates is
- A.
5
- B.
6
- C.
7
- D.
8
- E.
9
Answer
E
Explanation
Total roads . Each candidate visits all 20 cities in a Hamiltonian cycle using 20 roads. . Max candidates = 9.
Related Graph Theory questions
- #2125Base Systems: Faulty MicromanometerXATQADIMCQHard
- #2126Geometry: Inscribed Circle in Square ArcsXATQADIMCQMedium
- #2127Venn Diagrams: B-School ElectivesXATQADIMCQMedium
- #2128Coordinate Geometry: Minimum Distance SumXATQADIMCQMedium
- #2129Combinatorics: Magic Account NumbersXATQADIMCQMedium
- #2130Statistics: AP of Mean, Median, ModeXATQADIMCQHard
- #2131Number Theory: Quiz Marks AveragesXATQADIMCQMedium
- #2132Geometry: Cow Grazing AreaXATQADIMCQMedium
Practise this under exam conditions
Sign in to solve it with a live timer, the on-screen CAT calculator, and streak and accuracy tracking across every question you attempt.
Solve in the workspace