Graph Theory acob Mag YOSon B0rr-04-1- 77 Exam #1 (Chapter 1) ‘Name Date Period ‘SPRING 2015 SHOW ALL YOUR WORK TO RECEIVE FULL CREDIT!!! 1. You are tasked with scheduling the final exams for Math 115, Math 116, Math 185, Math 195, CS 101, CS 102, CS 273, and CS 473, using the fewest number of different time slots. If there are no students taking both Math 115 and CS 473, both Math 116 and CS 473, both Math 195 and CS 101, both Math 195 and CS 102, both Math 115 and Math 116, both Math 115 and Math 185, and both Math 185 and Math 195, but there are students in every other pair of courses. a. Draw a graph to best represent this situation. b. What is the fewest number of different time slots needed to administer all of the final exams? Stet 4 2 Gi i Hees. Ge een. ESteN 65213). SE Ste es Motntig CS le? Mate 85 c. What aspect of graph theory does this problem relate to? (Name the topic and state your answer to part (b) using a mathematical way to reference your answer.) gett Grpn Cotorong Sle is2. The graph below illustrates travel availability between various cities in the United States. The table provides flight times of each flight and associated costs, ‘Atlanta = Chicago 140 | $99 ‘Atlanta — Miami 1:30_| $69 ‘Atlanta — New York 155_| $79 ‘Boston — Chicago 2:10_| $79) ‘Chicago - New York 1:50_| $59 ‘New York — San Francisco | 4:05 | $129 ‘Chicago ~ San Francisco | 2:55 | $99 ‘Denver San Francisco 1:40_ |" $79) Denver= Chicago 2:10 | $69 ‘Los Angeles — Denver 2:00_| $89 ‘Los Angeles —New York | 3:50 | $129 ‘Miami — New York 2:45 | $99 ‘New York — Boston 050 | $39 [San Francisco —Los Angeles | 1:15 | $39 a. Use Dijkstra’s to find the quickest path from San Francisco to Miami. (Provide the quickest path, the time of your path, and permanent labels only needed for this path.) See uext page. b. Use Dijkstra’s to find the cheapest path from San Francisco to Miami. (Provide the cheapest path, the cost of your path, and permanent labels only needed for this path.) See next fe EMiami: Bes (A) aw -ACCES Sa 4228 San Fran. > NewYork -> Miami3. Given the following adjacency matrix: Maro 1 3 0 4 Vi <2-de_3e-00) Wa [Sexe 0! vio 3 0 0 2 velg 01 2 3: a, Construct the corresponding multigraph. b, How many paths of length 8 are there from vertex A to vertex D? sem a c. How many total paths of length 4 exist in the graph? fuuntr] A = [leous] ee d. Classify the following paths: i, ABECBBA~4, For the following pairs of graphs, state whether the any of the graphs are isomorphic to each other. If they are isomorphic, justify the isomorphism. If they are not isomorphic to any of the others, state why this is the case, & & ae es ical tescs tiga ee Bie ies oP GN D-0 H=+Q aw Net Isomorphic — verties with degree 2 are adjacent on lePt (4,2) bot vet on oes (o,!)5. Consider the modified Kénigsberg problem of seven bridges to include two additional bridges (as shown below). a, Suppose you are tasked with determining if someone could cross all nine of these bridges exactly once and return to the starting point. What speeific type of path studied in this course does this problem represent? b. Construct a graph to model this problem, and use the appropriate method to solve the task stated in part (a). The patr does not exrst. Zz. x) Vertes B and Dae of6. A round-robin tournament is a tournament where each team plays every other team exactly once and no ties are allowed, a, Construct a graph to model the results of a round-robin toumament with six teams. Can a Hamiltonian cycle be found? Explain why or why not. idertee 5 . “ fees ah. oe Mle ties" enns all ver Hees ¥ wsst Lave otrhteren ¢ O i wins (eobetenree) ° Ham. cyete PNE Pecarr 3 wa vertex with ovtolegree ; es zero. a b. Modify your answer for part (a) to allow two teams to tie with equal ranking. Can a Hamiltonian cycle be found under these conditions? Explain why or why not. ourdesree 1 le m 4 < Yes. One sock exe f is bg bly uted. s easANSWERS: Lad b. Stimeslots; ¢. coloring (chromatic number of graph: n= 5) San Franesico; Chicago; Atlanta; Miami — 6:05 San Francisco; New York; Miami - $228 poe ms b. 1,873,364; c. 16,048; d. i) circuit ii) walk 4. a. isomorphic (Answers may vary; sample bijection: A=T, F=O, G-L, B=S, E=N, H=P, J=Q, C=U, D=M, I=R) '. not isomorphic (same degree sequence; but two vertices with degree 2 are adjacent on left and not on right) . 5. a, Euler circuit f € be ® © b. B& D have odd degree; therefore no Euler circuit exists6. A round-robin ioumament is tournament where each team plays every other (caun exseily ovce ' and no ties are allowed. 4. Construct @ graph to model the results of @ round-robin tournament with six cams, Cama Hamiltonian cyele be found? Explain why or why not, adDy-o» 8) h. °6 f " i ‘@Wea-D ms No Ma.» “VE alwectet Hon. cycle 2 -ene been lost oaogpll = Bere ty b, cnnnmmnliniementicteinis Cana Hamiltonian cycle een Explain why or why not. ma i & Sy ceverse Naf to Pon now 2 teams he ._ > fF net dweeted, yes P3 © dwectes, yes