Solution Found!
Consider a TSP with 11 vertices labeled A through K. (a) How many tours are of the form
Chapter 6, Problem 34(choose chapter or problem)
Consider a TSP with 11 vertices labeled A through K. (a) How many tours are of the form A, B, . . . , A? (Hint: The remaining nine letters can be rearranged in any sequence.) (b) How many tours are of the form C, . . . , K, C? (c) How many tours are of the form D, B, . . . , K, D?
Questions & Answers
QUESTION:
Consider a TSP with 11 vertices labeled A through K. (a) How many tours are of the form A, B, . . . , A? (Hint: The remaining nine letters can be rearranged in any sequence.) (b) How many tours are of the form C, . . . , K, C? (c) How many tours are of the form D, B, . . . , K, D?
ANSWER:Step 1 of 3
Let us consider a TSP with 11 vertices labelled A through K.
The total number of vertices is 11.
When we start a tour of the form A, B, …., A, we know the starting point A and the second point B.
So, the number of tours of this form is the number of arrangements of the remaining nine alphabets.
9 remaining alphabets can be arranged in ways.
So, the number of tours of the form A, B…, A is .