Determine if two graphs are isomorphic and identify the isomorphism
Вставка
- Опубліковано 5 жов 2024
- Click SHOW MORE to see the description of this video.
Need a math tutor, need to sell your math book, or need to buy a new one? Check out these links and help support Ms Hearn Mathematics at the same time!
Find an online or local tutor here! shareasale.com...
Sell your textbooks here! shareasale.com...
The video explains how to determine if two graphs are NOT isomorphic using the number of vertices and the degrees of the vertices. Then, given four graphs, two that are isomorphic are identified by matching up vertices of the same degree to determine an isomorphism.
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!
Your tutorials make things so clear. Thank you so much for your work.
I like this kind of explanation. Clear, and straight to the point. Please keep on posting this kind of videos!!
this was so simple and straight forward, thank you ma'am
Thanks a lot. I have my final term tomorrow :P
Same here
thanks ms.hearn..You are a life savior
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!
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....
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
perfection definition is clear precise and to the point which is this video ,great job!
Glad you think so! Thanks!
Thank you very much, currently taking Discrete Math and the teacher isn't so great; this helps a lot!
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. :-)
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!
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
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.
Melissa Hooper
MW 9:30
Imagining that the edges are like strings really helps me
After watching lots of videos on this topic .. finally i got the point .. thank you :)
I wish my teacher would have explained it like this. I totally understand now! Thank you so much!
Thanks for the video! 😊
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
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. :-)
Thank you so much clear this concepts ❤️👌👌🙏🙏
Thanks a lot for posting this video.This video was very helpful and illustrative.
Thank you so much for the positive feedback! :-)
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
Great video! Thanks for making it.
Glad you liked it!
my exam were last week but I am here for the quality content
Thanks for watching! :-)
I LOVE THIS VIDEO!!! Really helped a lot! Thank you very much, you made everyhting very very clear.
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.
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.
Thanks Ms. Heard👍
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. 😁
You are good educator
Thank you so much!
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".
Maria D.
MW 9:30 am
Isomorphic simply means that two graphs are equal to eachother.
Very well explained. Thanks very much!
Deshawn McKenzie
MGF1107 MW @
The degree of a vertex is the number of edges that meet at that vertex
Very Nice and understanding .........
Thanks Ms. Heard
You are very welcome!
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.
Thanku
I understand it very well
Now i can solve any of the problem 😇
Great 👍
thank you. Brilliant, through and yet an easy explanation of the core concepts :)
Thanks a lot.That was really helpful.
Charis Hewlett
MGF1107 MW 9:30
I learned that if they are isomorphic, they basically have the same structure.
Andrea Price MGF1107 MW 9:30. My takeaway from this video is that isomorphs have the same amount of edges and vertices.
nicely explained!
Glad you think so!
Juan Betancur
MGF1107 MW 930-1045
when two graphs are isomorphic it means they are equivalent 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
thank you from Yemen:))
Tariah Foster
MGF1107 MW 9:30
The degree of a vertex is the number of edges that meet at that vertex
please include videos of Euler and Hamiltonian Graphs
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?
Thanks from India
Matthew Lannon, MGF1107 21Z,"its much easier to show that two graphs are not isomorphic often than it is to show that they are"
Claire Espada-Diaz MGF1107 MW930 - I learned "to confirm an isomorphism, find corresponding vertices of same degree and make sure the neighbors match op."
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"
Thank u so much. Nice work.
Thanks a lot.. help me a lot for my exam.. :D cheers.
Fantastic!
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.
thank you from Brasil :))
Simple and Smart! thanks
Very helpful, thank you.
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. :-)
"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
Sanche.. MGF1107 21Z "any graph we can obtain by simply dragging vertices in this way will be isomorphic to the original path."
Malik Footman
MW 9:30
Same # of vertices, same degree, and same shape.
Hi
Q) If G1 is r1-regular and G2 is r2-regular , G1+G2 is Euler circuits or not .
Randale Rose
MGF1107 MW 9:30
one way to find out if graphs are isomorphic is to count the number of vertices
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.
Ms. Hearn with the save. Also for levity’s sake, B-J.
Awesome! Thanks!
Thanks from kerala India
You are welcome, from Davie, Florida! :-)
thanks i finally understand it
Thank u so much :)
Sir , How I can prove that the diameter of a self complementary is greater than or equal to 3 ??
Kellene Walker
MGF 1107 MW 9:30AM
To identify an isomorphism between two graph they must have the same essentially structure.
what if degrees of all vertices are the same? how do you identify which vertex is equal to which?
Great Video!
well explained
I appreciate the positive feedback! Thanks. :-)
Thank you
Thanks
awesome video
Glad you like it! I appreciate the positive feedback. :-)
Thanks!
thank you so much
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! ☺️
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."
Melissa Seymour
MGF1107
I learned about the two graphs having the same degree and shape which are isomorphic this 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, ua-cam.com/video/tkiCATL7Ppk/v-deo.html. I hope it helps!
Ms. Hearn thanks for the help. :)
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!
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!
Matthew Diriwachter MGF1107 21Z
"An isomorphism is our way of saying that two graphs are equivalent."
¡Gracias!
Her voice😍😍
Brian Painchault
MGF1107
What I like about this video is the difference noted between each graph being isomorphic.
Vry imprsve mam nd thnx ☺
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.
thank you! :D
PERFECT!
Wow! Thanks! 😁
MGF 1107 21Z "the only way to really confirm that I have an isomorphism is to create the isomorphism"
thank you mam.
Most welcome 😊