Please help me with these question. I am having trouble understanding what to do.

Thank you
Transcribed Image Text:Consider the given graphs: 112 ug 47 16 G V3 13 Vg 14 V7 V6 V5 H V4 Click and drag the statements in correct order either to show that these graphs are not isomorphic or to find an isomorphism between them using paths. Now u, is adjacent to uz and us, and v2 is adjacent to v₁ and vɔ, so uz <> v and u3 <> v3. So try to construct an isomorphism that matches them, say u₁ → V2 and us → V6. Having thus been led to the only possible isomorphism,check that the 12 edges of G do not correspond to the 12 edges of H; hence the two graphs are not isomorphic. There are two vertices in each graph that are not in any cycles of size 4. Having thus been led to the only possible isomorphism, check that the 12 edges of G exactly correspond to the 12 edges of H, and the two graphs are isomorphic. Proceeding along similar lines, complete the bijection with us → V8, U6 → V7, and u7V5.
Transcribed Image Text:Find the strongly connected components of each of these graphs. a b C Multiple Choice g (a, b, c, d, f, g, h, 1} and {e} (a, b, c, d, f, g, h, 1} (a, b, c, d, f, h, }} and {e} (a, b, c, d, f, g, h, i, e}

Question

Please help me with these question. I am having trouble understanding what to do.

Thank you

Accepted Answer

Answered: Image /qna-images/answer/c4235439-7535-4f1e-8d0b-89f7bb21ea53.jpg