00 00 Which of the following vertices are adjacent to vertex v6 ? A. V1 B. U2 C. V3 D. V4 V₂ E. V5 F. V6 G. V7 H. V8 I. None of the above V V₁ V₁₂ V₁ 8

?!?

(a) By looking at the figure, explain why the number of shortest routes from A to D, C(9, 3), plus the number of shortest routes from A to E, C(9, 4), should equal a single combination, C(10, 4). Choose the correct answer below. OA. All combinations from A to B pass through point C. OB. The two points where the combinations stop are the two points that make up the intersection of B. OC. The two points where the combinations stop are two of three of the points that make up the intersection of B. OD. The only routes from A to B are contained in these two combinations.

Consider the following two graphs G1 = {{a,b, c, d, e, f}, {ab, a f, ae, bc, bf, be, cd, cf, df, ef}}, and G2 = {{v1, v2, v3, v4, V5, V6}, {v1v2, v1V3, V1V4, V1 V5, V2V3, V2V6, V3V4, V3V5, V3 V6, V4V5}}, %3D (a) is the function b c d f a e U5 v2 V4 V3 a graph isomorphism? (b) can you construct a bijection of vertices that is not an isomorphism? explain. (c) provide a drawing that represents this isomorphism class.