Nice explanation but you could have also taken a graph with more than 1 common edge and then explained it too for determining the number of spanning trees.
You should have added that deleting C and then A or B would be the same as deleting A then C or B then C, because some people might think there were 10 spanning trees and not realize they were counting twice :P
Absolutely wonderful and concise explanation. Super helpful to explain an otherwise difficult topic.
AWESOME! easy and simple explanation! thanks:)
Great explanation. Thank you!
Nice explanation but you could have also taken a graph with more than 1 common edge and then explained it too for determining the number of spanning trees.
thank you for teaching me
You should have added that deleting C and then A or B would be the same as deleting A then C or B then C, because some people might think there were 10 spanning trees and not realize they were counting twice :P
Thanks for sharing!
Explanation mast madidri sir. Tqsm
thanks sir for wonderful exp
thanks a lot !
thank you
What about weighted minimum spanning trees?
Another way to do is using Matrix tree computation ..
Greatttttt
This is so cool!!! In my university they use clayley formula, its way to complicated this solution
3 likes :')