Discrete Math II - 10.3.2 Graph Isomorphisms

Let's take a look at whether two graphs are isomorphic. For graphs to be isomorphic they must have the same number of vertices and edges. But more than that, they must also have the same structure. That is, the degree of vertices must match up, as well as the incidence of edges.

Video Chapters:
Intro 0:00
Intro to Graph Isomorphisms 0:05
Definition of Isomorphisms of Graphs 3:46
Graph Isomorphism Example 5:09
Graph Isomorphism Practice 9:37
Graph Isomorphism Theorem 10:36
Up Next 13:07

This playlist uses Discrete Mathematics and Its Applications, Rosen 8e

Power Point slide decks to accompany the videos can be found here:

The entire playlist can be found here:

[silvo]

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

[doomcake]

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

[catherinesalazar]

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!

[valeriereid]

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

[力-vi]

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

[colonelh.s.l.]

Why do the degrees have to be the same?

[rroiwtg]

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