Question

19. Use the definition below and the minimum criteria a graph must meet in order to be potentially isomorphic to answer the question Recall Definition: Isomorphism: For a graph G1 V, E13 and G2-V2, E23 G1is isomorphic to G2 denoted GG2 iff af:V V2where i) f is bijective and Describe an isomorphism between the following two graphs, or briefly explain why no such isomorphism exists. f(A)1 f(B)6 f(C) 3 f(D)8 IG)2 f(H)5 f(I)4

Answer 1

14 丁 Iboth gph G, and G, thete aee 8 vetlicee andl 12 edges, and each ved in both the A bijedive mapping is :vi--w fv (CH) -5 ん(1) 4 mappin E, s a bjedue exe i a ble ctuue mappin edge (A G)>edge (1,2) edge ( A, H)-> edge (.5) edge (A.1)- > edge (1,1 edge (r, G)-> edge (G,2) edge (O, edge (6, 5) edge (B, J.) → edge (6,7)

Je Cc,G)> edge (3, 2 edge (c,Z) → edge (3,4) edge (c,t) → edge (3,7) edge CP, H)--> edge (8,5) edge Co.) → edge (8,4) edge (D,T) → edge(AF eel and G ate iso e G,G.