Literally a perfect explanation of the concepts we hit in my university level course. What took 20 minutes of explanation in class only took 8 mins, brilliant!
4:55..........you should compare the degree of adjacent vertices of vertex 4..........that way in the top left graph degree of adjacent vertices of vertex 4 is=3,3,2,2........where as the degree of adjacent vertices of vertex 4 is=3,3,3,2........hence not isomorphic....if your still confused.....use cycles of graph to determine instantly....
Thank you! By the way, I wrote a chapter on graph theory which you might find helpful. Although I should warn you that different textbooks use different terminology when it comes to paths and circuits. openstax.org/books/contemporary-mathematics/pages/12-introduction
Thank you for explaining this concept so well! Your examples are very easy to follow which makes understanding identifying isomorphic graphs less complex! -Morgan Scott MGF 1107 21Z Fall 2018
We determine how to graphs have Isomorphism with the same structure. To determine if graphs are isomorphic you must first eliminate by first counting the number of vertices and then analyze the degree of each vertex. It’s important to make a conclusion that 2 graphs are isomorphic by looking at the vertices of the same degree and then make sure the neighbors match up . Collier Rutledge MG1107
Nice video. You could also use the number cycles and their count to compare graphs. Example: If one graph has 3 cycles of 2, 3 and 5, and another graph has 3 cycles of 3, 3, 5 then they are non-isomorphic.
Given two random complicated graphs, what would be the methods at determining whether two graphs are isomorphic. Also if two graphs have the same number of edges and vertices and all vertices have the same degree, does that make the graph isomorphic?
Theska Moise M-W 9:30 am In this video I learned that two graph that are isomorphic means they match to each other, they are the same, they are equal to each Other.
Carolina Rodriguez MW 930 Imagining that the graph is string is extremely helpful. Also the explanation of finding the vertices and degrees was very clear and helpful.
Claire Espada-Diaz MGF1107 MW930 - I learned "to confirm an isomorphism, find corresponding vertices of same degree and make sure the neighbors match op."
Briana Mims MGF 1107 21Z "An Isomorphism is our way of saying that two graphs are equivalent. they have the same number of vertices, same degree, and they have the same shape".
Savannah McMillen MGF1107 21Z "To easily determine if two graphs are isomorphic you should start by counting the number of vertices and analyzing the degree of each vertex...if they have the same number of vertices and the same degree of each vertex then they will be considered isomorphic"
"An isomorphism is our way of saying that two graphs are equivalent. They have the same number of vertices, they have the same degree, and they have the same shape." Nia Johnson MGF1107 21Z
Good question! No. It must be that it is possible to twist or turn the graph in some way (without disconnecting or reconnecting any parts) so that BOTH the vertices and the edges are identical. In this video I show a physical demonstration with toys, ruclips.net/video/tkiCATL7Ppk/видео.html. I hope it helps!
Bianca Montgomery MGF1107 This video helped me understand a straightforward method for determining whether or not two graphs are isomorphic and identifying the isomorphism between them. Because of this video, I have a better understanding of the exercises.
Why in the holy love of hell can my professor not explain this during a 60 minute class and in just 2 minutes you have clearly explained how to find isomorphism. That is unacceptable
Name: Nayelhi Nevarez Course: MGF1107 I learned the easy way to determine if two graphs are isomorphic and identify the isomorphism on this video. I can understand the exercises more with this video. Thank you, professor!
Literally a perfect explanation of the concepts we hit in my university level course. What took 20 minutes of explanation in class only took 8 mins, brilliant!
I like this kind of explanation. Clear, and straight to the point. Please keep on posting this kind of videos!!
Your tutorials make things so clear. Thank you so much for your work.
thanks so much, i have an exam in less than an hour and i could not attend the lecture, you are my savior :D
Glad I could help!
¡Gracias!
this was so simple and straight forward, thank you ma'am
You are the only one shining light on all my doubts. Everything cleared. Thanks a lot :) !
Happy to hear that! That's so nice of you to say!
Thanks a lot. I have my final term tomorrow :P
Same here
4:55..........you should compare the degree of adjacent vertices of vertex 4..........that way in the top left graph degree of adjacent vertices of vertex 4 is=3,3,2,2........where as the degree of adjacent vertices of vertex 4 is=3,3,3,2........hence not isomorphic....if your still confused.....use cycles of graph to determine instantly....
Taylor Slotsky
MGF1107 MW 9:30-10:45am
to confirm an isomrphism, find corresponding vertices of same degree and make sure that the neighbors match up.
Thank you. My teacher explained it so badly. I managed to solve the practice Questions after watching your videos.
thanks ms.hearn..You are a life savior
You explained it way better than my textbook did!
Thank you! By the way, I wrote a chapter on graph theory which you might find helpful. Although I should warn you that different textbooks use different terminology when it comes to paths and circuits. openstax.org/books/contemporary-mathematics/pages/12-introduction
This is exactly what I needed, thank you!
perfection definition is clear precise and to the point which is this video ,great job!
Glad you think so! Thanks!
Omg I had you as my Calc 2 professor a while back and I just realized after the video ended and saw your pfp. The video was great btw
No way! Great to hear from you. 😁
Thanks for the video! 😊
Thank you very much, currently taking Discrete Math and the teacher isn't so great; this helps a lot!
Great video! Thanks for making it.
Glad you liked it!
very helpful in understanding the isomorphism in graphs. Thanks a lot.
I am glad it was helpful! Thank you for taking the time to give feedback. :-)
After watching lots of videos on this topic .. finally i got the point .. thank you :)
Thank you for explaining this concept so well! Your examples are very easy to follow which makes understanding identifying isomorphic graphs less complex!
-Morgan Scott MGF 1107 21Z Fall 2018
Melissa Hooper
MW 9:30
Imagining that the edges are like strings really helps me
We determine how to graphs have Isomorphism with the same structure. To determine if graphs are isomorphic you must first eliminate by first counting the number of vertices and then analyze the degree of each vertex. It’s important to make a conclusion that 2 graphs are isomorphic by looking at the vertices of the same degree and then make sure the neighbors match up . Collier Rutledge MG1107
Thank you Ms. Hearn 😊
You are so welcome
thank you Ms. Hearn
You are so welcome
I wish my teacher would have explained it like this. I totally understand now! Thank you so much!
ohhh finally I learn from ur video that how isomorphism works thank u so much :-)
Yay! I am so happy to hear that it helped. :-)
Katherine Morales
M/W 9:30
It helped me to know that the degree of the vertex is the number of edges that meet at that vertex
my exam were last week but I am here for the quality content
Thanks for watching! :-)
Nice video.
You could also use the number cycles and their count to compare graphs.
Example: If one graph has 3 cycles of 2, 3 and 5, and another graph has 3 cycles of 3, 3, 5 then they are non-isomorphic.
Deshawn McKenzie
MGF1107 MW @
The degree of a vertex is the number of edges that meet at that vertex
Tariah Foster
MGF1107 MW 9:30
The degree of a vertex is the number of edges that meet at that vertex
Jim Charite
MGF 1107 MW 9:30
I learn to find out if graphs are isomorphic, the vertices and the number of degrees has to match.
Andrea Price MGF1107 MW 9:30. My takeaway from this video is that isomorphs have the same amount of edges and vertices.
Thanks a lot for posting this video.This video was very helpful and illustrative.
Thank you so much for the positive feedback! :-)
You are good educator
Thank you so much!
Thank you so much clear this concepts ❤️👌👌🙏🙏
Charis Hewlett
MGF1107 MW 9:30
I learned that if they are isomorphic, they basically have the same structure.
Thanku
I understand it very well
Now i can solve any of the problem 😇
Great 👍
I LOVE THIS VIDEO!!! Really helped a lot! Thank you very much, you made everyhting very very clear.
Thanks Ms. Heard👍
Malik Footman
MW 9:30
Same # of vertices, same degree, and same shape.
Given two random complicated graphs, what would be the methods at determining whether two graphs are isomorphic. Also if two graphs have the same number of edges and vertices and all vertices have the same degree, does that make the graph isomorphic?
Theska Moise
M-W 9:30 am
In this video I learned that two graph that are isomorphic means they match to each other, they are the same, they are equal to each Other.
Symphony M. MW 9:30. My take away from the video is one way you can determine that graphs are isomorphic is by counting the vertices
Sir , How I can prove that the diameter of a self complementary is greater than or equal to 3 ??
Thanks Ms. Heard
You are very welcome!
Randale Rose
MGF1107 MW 9:30
one way to find out if graphs are isomorphic is to count the number of vertices
Carolina Rodriguez
MW 930
Imagining that the graph is string is extremely helpful. Also the explanation of finding the vertices and degrees was very clear and helpful.
thank you from Yemen:))
Very well explained. Thanks very much!
Maria D.
MW 9:30 am
Isomorphic simply means that two graphs are equal to eachother.
please include videos of Euler and Hamiltonian Graphs
Claire Espada-Diaz MGF1107 MW930 - I learned "to confirm an isomorphism, find corresponding vertices of same degree and make sure the neighbors match op."
Very Nice and understanding .........
Thank u so much. Nice work.
what if degrees of all vertices are the same? how do you identify which vertex is equal to which?
Briana Mims MGF 1107 21Z "An Isomorphism is our way of saying that two graphs are equivalent. they have the same number of vertices, same degree, and they have the same shape".
Hi
Q) If G1 is r1-regular and G2 is r2-regular , G1+G2 is Euler circuits or not .
Thanks from India
Thanks a lot.That was really helpful.
Glad to hear it! Thank you for taking the time to give me positive feedback. I love it!
What is the formula for finding the number of different isomorphic graphs?
Excellent question. I’m not sure. Let me know if you find out! ☺️
Thanks a lot.. help me a lot for my exam.. :D cheers.
Fantastic!
Juan Betancur
MGF1107 MW 930-1045
when two graphs are isomorphic it means they are equivalent to each other.
How can i check how many isomorphism exist between those two final graphs with same vertices?
That's a good question! I don't have the answer to that, but if I find out, I will let you know. Thanks for watching!
Very helpful, thank you.
Simple and Smart! thanks
Savannah McMillen
MGF1107 21Z
"To easily determine if two graphs are isomorphic you should start by counting the number of vertices and analyzing the degree of each vertex...if they have the same number of vertices and the same degree of each vertex then they will be considered isomorphic"
nicely explained!
Glad you think so!
thank you from Brasil :))
thank you. Brilliant, through and yet an easy explanation of the core concepts :)
Thanks from kerala India
You are welcome, from Davie, Florida! :-)
Kellene Walker
MGF 1107 MW 9:30AM
To identify an isomorphism between two graph they must have the same essentially structure.
thanks i finally understand it
"An isomorphism is our way of saying that two graphs are equivalent. They have the same number of vertices, they have the same degree, and they have the same shape."
Nia Johnson MGF1107 21Z
Great Video!
what if two graphs have same vertices but edges are not same? is it isomorphic?
Good question! No. It must be that it is possible to twist or turn the graph in some way (without disconnecting or reconnecting any parts) so that BOTH the vertices and the edges are identical. In this video I show a physical demonstration with toys, ruclips.net/video/tkiCATL7Ppk/видео.html. I hope it helps!
Ms. Hearn thanks for the help. :)
Matthew Lannon, MGF1107 21Z,"its much easier to show that two graphs are not isomorphic often than it is to show that they are"
Ms. Hearn with the save. Also for levity’s sake, B-J.
Awesome! Thanks!
Sanche.. MGF1107 21Z "any graph we can obtain by simply dragging vertices in this way will be isomorphic to the original path."
Brian Painchault
MGF1107
What I like about this video is the difference noted between each graph being isomorphic.
Do the degrees have to be the same to be isomorphic?
Yes! The degrees of the vertices must all match or the structure of the graph is different. :-)
Thank you
Bianca Montgomery
MGF1107
This video helped me understand a straightforward method for determining whether or not two graphs are isomorphic and identifying the isomorphism between them. Because of this video, I have a better understanding of the exercises.
Why in the holy love of hell can my professor not explain this during a 60 minute class and in just 2 minutes you have clearly explained how to find isomorphism. That is unacceptable
LOL I am glad you found the video helpful. Thanks for watching. :-)
Thank u so much :)
Thank you so much! :D
You're so welcome! 😊
Her voice😍😍
Melissa Seymour
MGF1107
I learned about the two graphs having the same degree and shape which are isomorphic this video.
well explained
I appreciate the positive feedback! Thanks. :-)
awesome video
Glad you like it! I appreciate the positive feedback. :-)
Thanks
Name: Nayelhi Nevarez
Course: MGF1107
I learned the easy way to determine if two graphs are isomorphic and identify the isomorphism on this video. I can understand the exercises more with this video. Thank you, professor!
thank you so much
Thanks!
Vry imprsve mam nd thnx ☺
Thank you!!!!
You're welcome! Thanks for watching!
Valerye Baldock MGF 1107 21Z
"The degree of the vertex is the number of edges that meet at that vertex."
Gracie r mgf1107
One take away from this video is that 2 graphs can not be isomorphic if they don't have the same number of vertices.