Isomorphic Graphs - Example 1 (Graph Theory)

Показать описание

Рекомендации по теме

Комментарии

Thank you so much! What a simple concept to explain yet teachers overcomplicate it by saying d(vi) and d(ui) must be the same if f(ui) = vi. So much easier to just say Isomorphic because equal number of equal cycles within graph or unequal because differing number of equal/unequal cycles within graph!

andreischannel

Please in the last diagram where you used the cycles, you left out one 5 cycle on the diagram on the right, the external five cycle
Although that won't change the fact that the graphs are not isomorphic😊

akackon

Thanks so much! The colors made it much easier to see!

charlenesutton

This second problem is bothering me allot. Just because at a glance I said "They're not isomorphic, no matter how you rearrange the vertices in the graph on the left at least two edges will cross, whereas the right side graph has no crossing edges". My issue being what I thought seems very intuitive to me, but I have no concept how I can formally prove it -_-

bit_pineapple

Really good explanation. Thx mate and keep up the good work!

Bomber

finally thanks for a great video. hard to find one on the subject

adamlk

How come the number of cycles don't match means these two graphs are not isomorphic? Is there any reason behind it? And what if the cycles do match, does that mean the graphs MUST be isomorphic?

wangchaoyu

Nice and simple...nd the cycle one was nice

VikashSharma-wvvv

is there a systematic way to determine which nodes are associated with the other nodes like 5 to c, 1 to a and 3 b or can i just link any of the nodes to each other?

pspiso