Recognizing and Finding Spanning Trees in Graph Theory
ฝัง
- เผยแพร่เมื่อ 29 มิ.ย. 2024
- Are you an @MzMath Fan?! Please Like and Subscribe. :-)
And now you can BECOME A MEMBER of the Ms. Hearn Mathematics Channel to get perks!
/ @mzmath
This video explains the concepts of trees, subgraphs, and spanning trees for a Survey of Mathematics course (MGF1107).
This video is 6 minutes and it explains everything perfectly well!
I’m glad you liked it! 😁
Thank you so much Ms.Hearn for this amazing lecture on Spanning Tree in Graph Theory. Your explanation is great!
Thanks for this explanation, its simple and straight to the point.
very helpful, your explanation are much clearer than textbooks and some tutors ive had, thank you
You're very welcome!
Much appreciate for your clear explanations.
Many thanks, please consider adding more videos.
Thank you so much for making an understandable and concise video.
You are very welcome! ☺️
Amazingly Explained!
Thank you so much! I appreciate the positive feedback. :-)
@@MzMath Can you make a videos on how to find total no. of possible spanning trees of a given graph?
For a complete graph it's n^(n-2), but what if graph is not complete? I've heard about Kirchhoff’s Theorem that is used to find for NOT complete graphs but I'm unable to understand it.
Hi! I wish I could. That is something I would need to study.
Thank you ! this was helpful
This was awesome thank you so much!!
Thanks! I am glad you liked it!
Mam is there is any formula to find possible number of spanning trees
www.geeksforgeeks.org/total-number-spanning-trees-graph/