ANSWERS A-43 19. C A B D 20. D B C E A 29. a) O D L 400 250 100 450 125 150 S 30. a) B R S 393 113 855 841 337 803 T 31. a) T A C 342 521 663 917 1188 582 S 32. a) B 507 374 799 332 940 575 W M S 33. a) 5.6 0.9 2.4 6.4 4.8 1.7 2.3 3.1 4.3 7.2 O M S W R 34. a) 420 631 766 84 230 501 625 650 730 577 E J T W K 35. a) H C B K S 378 483 476 431 144 505 542 159 459 492 36. a) P M B S W 576 256 298 131 154 970 353 356 179 1164 38. a) ⋅ = = 2, 1; 2 1 2! 2 This result is the same as the number of Hamilton circuits in a complete graph with three vertices. c) ⋅ ⋅ ⋅ = = 4, 3, 2, 1: 4 3 2 1 4! 24; 5, 4, 3, 2, 1: ⋅ ⋅ ⋅ ⋅ = = 5 4 3 2 1 5! 120. These results are the same as the numbers of Hamilton circuits in complete graphs with five and six vertices, respectively. d) When starting at a vertex in a complete graph with n vertices, you have − n 1 choices. At your second vertex, you have one less choice, or − n 2 choices. This process continues until you only have one vertex from which to choose. SECTION 13.4, PAGE 884 7. Robert Sandi Angela Eli Connor Larry Jason Max Tony Gabriella 8. Kimber Cengiz Jo Samuel Burnette Arumugam Wasilea Robby Pierre 9. Stratton Wormer O’Ryan Park Dorfman Mancari Liebowitz Jennings Carter Hoover Blutarsky Kroger 10. Stevens Moore Binks Panzari Falkner Hill Downing Atkins Ellis Campbell Tipton Li Nguyen 11. A B C A B C D E F D E F Other answers are possible. 12. C B A E F D G H I C B A E F D G H I Other answers are possible.
RkJQdWJsaXNoZXIy NjM5ODQ=