Discrete Math II - 10.3.2 Graph Isomorphisms

[@doomcake2020]

I really appreciate the use of adjacency matrices at 7:40 - this really helped clarify a example in class I didn't understand!

[@silvo9460]

this is the final video i had to watch for my discrete 1 course. thank you so much Kimberly, i really appreicate it

[@somfy2617]

Same for me as well, thank you so much Kimberly! You made the math easy and fun for me to understand and I feel more confident for my final exam.

[@catherinesalazar2113]

Kimberky, thank you so so much for making things so easy to understand. I love Maths, but some topics are harder to get my head around than others and I am always so pleased when I type: "Kimberly B..." and there is a video or playlist on the topic I'm stuck with. Again, Massive thanks for your dedication!

[@punditgi]

Kimberly makes graphs cool!

[@SawFinMath]

Thanks!

[@valeriereid2337]

Happy New Year Professor Brehm, thanks so much for this thorough explanation.

[@SawFinMath]

Happy New Year to you!

[@力-v6i]

You helped a lot! May I ask what software you’re using for creating this kind of video? Thank you!

[@SawFinMath]

I use the Recording tab in power point. It allows me to rerecord one slide at a time if I mess up :)

[@user-rr9oi3wt1g]

Is there a video on 10.4: Connectivity by any chance?

[@SawFinMath]

Sorry, no!

[@user-rr9oi3wt1g]

@@SawFinMath No worries, thank you for your hard work!

[@colonelh.s.l.3834]

Why do the degrees have to be the same?

[@SawFinMath]

To be isomorphic, you need the graph to have the same structure. So the cycle structure of each corresponding edge must match up. Thank of it as being able to relable the existing graph with the vertex names of the new graph.