In the Traveling Salesperson Problem, is the shortest tour the same regardless of the start/return city? How do you prove it?
The optimal tour visits all vertices so it's still a tour regardless of where you start. The length of the tour is the sum of the lengths of its edges. Addition is commutative and associative so it doesn't matter what order you do the addition.