Question

(c) Determine whether the given pairs of graphs are isomo or provide a rigorous argument that none exists. Answer:

Answer 1

Two graphs are sard to be rsomorphic the have scunve number of verrtices amd samme mumber of edges and same number of verbices with degree kand or eveny prope subgraph g of eme grapt hure must be a proper subgraph op the other graph that s somorphe of g U3 a Theoratically we can sey graph G Cv.E, ome isomorphc f theve exists a one to and onto functionf from tu v2 the propent that and b ane adjacentin G nd emly FCa) and fcb) ame

Given ㈥blem) pag e ui Vn. 43 Gh 1 N 8 G1 2 no of edges 12 noof edges 12 no.of verbtes- some no of veréices oith degree :Cieolegree e3 is aul verbles arre hauing degnee 3

take any sub gon hfvern b0H9Yaph5 ( page 3 ui 니2. Vs U 6 es we cam apply above said cenditiens hese grauphs coil satisfy. so hese subgrouphs are also Somorphi Therefore e cam say given graphs are rsomorphuc