Counting Spanning Trees

[@aditolia]

Absolutely wonderful and concise explanation. Super helpful to explain an otherwise difficult topic.

[@lizbethlachica6605]

AWESOME! easy and simple explanation! thanks:)

[@Der_Befraier]

Explanation mast madidri sir. Tqsm

[@joes.2647]

Great explanation. Thank you!

[@AManFromAnotherEarth]

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.

[@Taricus]

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

[@soonchitachakraborty8583]

What about weighted minimum spanning trees?

[@nikhilsharma2685]

thanks sir for wonderful exp

[@gordonfang0409]

Thanks for sharing!

[@nektariak912]

thanks a lot !

[@tr233]

This is so cool!!! In my university they use clayley formula, its way to complicated this solution

[@mahrokhebrahimi6863]

Greatttttt

[@ShashankParekh]

Another way to do is using Matrix tree computation ..

[@infiniteunconditionallove1620]

thank you

[@abnormalbat1966]

3 likes :')