Number of Spanning trees possible in given Grpah | Kirchoff's Matrix Tree Theorem | Graph Theory #18

Number of Spanning trees possible from a given graph can be found out Kirchoff's Matrix Tree Theorem.ALSO USE FOR COMPLETE GRAPH.

[@ritikagupta8847]

It would be helpful if you could explain how Kirchoff's Matrix Tree Theorem works internally.

[@williamj.stilianessis1851]

You had me right up to the end. I wish you had covered how to solve with 8 as the answer.

[@afaqasif4250]

Thanku sir. Tommorow I have quiz of this topic surely i will pass bcuz of you

[@user-xn4dm6qp3u]

you deserve love

[@antzelo0056]

You are the best man!!!

[@kavithapriyacj4868]

thank u so much millions crores more than that..realy u saved my time yaar........thanks alot

[@sarikagoswami3561]

Sir, Please make a video on recurrance relation, how to solve it, how to create it from a given program

[@bhaktijambhale]

Yes sir please.

[@pranavverma4254]

THANKS FOR THIS EXPLANATION

[@NitinYadav-gb4zt]

sir,please make a video for kruskal algorithm for mst (explain it's code ).Well known about it's algorithm but lots of students facing problemm while writng code.

[@016_shivakantpal3]

What about the 5 vertex problem
5 rows and 5 cloumns
How toh solve determinant than?

[@shubbhmewada9909]

Thanks a lot!

[@tamagoyakiv4871]

Thanks! You're a life saver, Sire TvT

[@keerthivasan-ry6lt]

tnks bro it is very useful

[@th6718]

it was good video! but you skipped a part at the end when you were calculating the determinant..

[@rimiroy8059]

Excellent

[@shakebahmed343]

Thank you a lot sir

[@wasirizvi6844]

please upload how to find running time complexities of algos. thank you

[@sulaikabeevi1996]

super....upload more videos

[@_mvansan]

thank bro :D

[@sergiogastulo6264]

bro u fucking kidding where da hell this formula comes? u awesome bro

[@swarupgorai]

What if we have 9*9 matrix...how to find its determinant.

[@InspiringInsightsbyprajjaldhar]

use combination formula
(edges)C(vertices-1) - no.of loops formed

[@InspiringInsightsbyprajjaldhar]

here no of edges is 5 and vertices-1=(4-1)=3 now 5C3=10-no of loops formed=10-2=8

[@Gaurav-zh4pm]

@@InspiringInsightsbyprajjaldhar how number of loops are 2 can you tell?

[@InspiringInsightsbyprajjaldhar]

@@Gaurav-zh4pm see according to Kirchoff 123 form 1 loop and 243 forms 2nd loop

[@rajendrakujur2078]

@@InspiringInsightsbyprajjaldhar doesn't 1234 makes another loop??

[@kabileshr7390]

sir if the number of vertices in a graph is 6 how to calculate the number of spanning tree

[@rajivmishra103]

5*5 determinant which is very complex.

[@Rajat-qo7ot]

Hello friends ,lol