Sir,in the final answer there is a small mistake , vertex 'E' should be mapped to vertex '3' and vertex 'F' should be mapped to '4' because between 'E' and 'B' , there is an edge , so a/q to your answer,there should be an edge between '4' and '1' , but that doesn't exist in the 2nd graph.
under "adjacent vertices degree" column for G2, you wrote 3,2 for 5 but it it actually 3,3. Can you check it again or am i missing something. so i think its not isomorphic. fantastic explaination btw.
searched video all over TH-cam but did not find such a great video on this topic like yours
thank you so much sir .....🙏😊😊
Tq very much sir, this video helps me a lot
u are such a good teacher.
Sir,in the final answer there is a small mistake , vertex 'E' should be mapped to vertex '3' and vertex 'F' should be mapped to '4' because between 'E' and 'B' , there is an edge , so a/q to your answer,there should be an edge between '4' and '1' , but that doesn't exist in the 2nd graph.
Bro you have sooooo talent......😊😊😊😊😊
Very very easy approach😊
Thank you sir 🥳💪🥰
under "adjacent vertices degree" column for G2, you wrote 3,2 for 5 but it it actually 3,3. Can you check it again or am i missing something. so i think its not isomorphic. fantastic explaination btw.
Best lecture 👍
Thank You
There is a edge between A-B but not 6-1, so is it isomorphic or not?
Thanks u so much sir
Nice video
JazakALLAH HU khyrn kasirn...but sometimes we have to check the no.of cycles in both Graph then what we can then ...?
Tq sir
Thnks
Thank you sir
adjacent vertex of 5 is {3,3}
You are not talked about incidence relationship preservation which is very important
i have a doubt sir
Can i write This in Vtu exams
saved my life 3 hours before my final legend
Video 1 please
Thank you sir