components for this graph. Determine which members sit on a single committee. Determine which committees have the fewest representatives from Texas. Determine cutvertices if any exist. Section 2.1: 1, 2, 3, 5, 6, 8, 11, 15-18 Section 2.2: 1-3 Section 2.3: 1-4, 7-9, 19-22 (ignore part (e)), 30, 31, 33, 38 Section 2.4: 1, 2, 3, 8-21, 31, 38 Let be any graph with 10 vertices. Prove that cannot be isomorphic to its complement. G G Determine the values of such that any graph with vertices is not isomorphic to its n n complement. Section 3.1: 2, 3, 4, 5, 10, 11, 13, 14 Section 3.2: 1-3, 5-13 Section 3.7: 1-3, 7-9 Section 4.3: 1-4 apply both and to find any MST, 5-8, 10, 11 Prim’s Kruskal’s algorithm Section 7.2: 1-5, 7-11, 13 Section 9.1: 1-9, 20, 21
components for this graph. Determine which members sit on a single committee. Determine which committees have the fewest representatives from Texas. Determine cutvertices if any exist. Section 2.1: 1, 2, 3, 5, 6, 8, 11, 15-18 Section 2.2: 1-3 Section 2.3: 1-4, 7-9, 19-22 (ignore part (e)), 30, 31, 33, 38 Section 2.4: 1, 2, 3, 8-21, 31, 38 Let G be any graph with 10 vertices. Prove that G cannot be isomorphic to its complement. Determine the values of n such that any graph with n vertices is not isomorphic to its complement. Section 3.1: 2, 3, 4, 5, 10, 11, 13, 14 Section 3.2: 1-3, 5-13 Section 3.7: 1-3, 7-9 Section 4.3: 1-4 apply both Prim’s and Kruskal’s algorithm to find any MST, 5-8, 10, 11 Section 7.2: 1-5, 7-11, 13 Section 9.1: 1-9, 20, 21