39. Draw complete graphs with four, five, and six vertices. How many edges do these graphs have? Can you generalize to n vertices? How many TSP tours would these graphs have? (Tours yielding the same Hamiltonian circuit are considered the same.)
39.
Drawings will vary.; 6, 10, and 15 edges, respectively; edges; 3, 12, and 60, respectively