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

preview_player
Показать описание
Number of Spanning trees possible from a given graph can be found out Kirchoff's Matrix Tree Theorem.ALSO USE FOR COMPLETE GRAPH.
Комментарии
Автор

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

ritikagupta
Автор

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

williamj.stilianessis
Автор

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

afaqasif
Автор

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

sarikagoswami
Автор

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

_shivakantpal
Автор

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

th
Автор

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

wasirizvi
Автор

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

swarupgorai
Автор

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

kabileshr
Автор

Thanks! You're a life saver, Sire TvT

tamagoyakiv
Автор

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

sergiogastulo
Автор

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

kavithapriyacj
Автор

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.

NitinYadav-gbzt