Reading assignment and practice problems (Hamilton)
Contemporary Math Section 2 T/Th 10am - Fall 2024
We will continue our discussion of graphs. We will look at a different type of circuit, called
a Hamilton circuit, in which each vertex of the graph is visited exactly once. Then we will discuss
a famous problem involving Hamiltonian circuits which is known as the Traveling Salesman Problem.
We will also learn two algorithms for finding an approximate solution to this problem.
Read:
Section 1.3 Hamilton Circuits pages 17 - 27 in the textbook.
Do:
Practice problems: #17, 19, and 21 beginning on page 42 in the textbook. These problems do not need to be turned in, but should be done for practice before doing the Online homework. The answers to the odd exercises can be found beginning on page 257 of the complete text.