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

Поделиться
HTML-код
  • Опубликовано: 12 дек 2024

Комментарии • 32

  • @ritikagupta8847
    @ritikagupta8847 3 года назад +13

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

  • @williamj.stilianessis1851
    @williamj.stilianessis1851 2 года назад +3

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

  • @antzelo0056
    @antzelo0056 Год назад +1

    You are the best man!!!

  • @PRIYANSHURANJANMISHRA
    @PRIYANSHURANJANMISHRA Год назад +3

    you deserve love

  • @afaqasif4250
    @afaqasif4250 Год назад +1

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

  • @kavithapriyacj4868
    @kavithapriyacj4868 3 года назад +5

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

  • @sarikagoswami3561
    @sarikagoswami3561 5 лет назад +4

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

  • @pranavverma4254
    @pranavverma4254 Год назад

    THANKS FOR THIS EXPLANATION

  • @016_shivakantpal3
    @016_shivakantpal3 11 месяцев назад +1

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

  • @rimiroy8059
    @rimiroy8059 4 года назад

    Excellent

  • @swarupgorai
    @swarupgorai 4 года назад +1

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

    • @dotenvwithprajjal
      @dotenvwithprajjal 4 года назад +2

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

    • @dotenvwithprajjal
      @dotenvwithprajjal 4 года назад

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

    • @Gaurav-zh4pm
      @Gaurav-zh4pm 3 года назад

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

    • @dotenvwithprajjal
      @dotenvwithprajjal 3 года назад

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

    • @rajendrakujur2078
      @rajendrakujur2078 3 года назад

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

  • @NitinYadav-gb4zt
    @NitinYadav-gb4zt 3 года назад

    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.

  • @sulaikabeevi1996
    @sulaikabeevi1996 5 лет назад

    super....upload more videos

  • @keerthivasan-ry6lt
    @keerthivasan-ry6lt 5 лет назад

    tnks bro it is very useful

  • @shubbhmewada9909
    @shubbhmewada9909 3 года назад

    Thanks a lot!

  • @sergiogastulo6264
    @sergiogastulo6264 4 года назад

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

  • @wasirizvi6844
    @wasirizvi6844 5 лет назад

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

  • @kabileshr7390
    @kabileshr7390 4 года назад

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

    • @rajivmishra103
      @rajivmishra103 4 года назад

      5*5 determinant which is very complex.

  • @tamagoyakiv4871
    @tamagoyakiv4871 4 года назад

    Thanks! You're a life saver, Sire TvT

  • @th6718
    @th6718 4 года назад

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

  • @shakebahmed343
    @shakebahmed343 5 лет назад

    Thank you a lot sir

  • @_mvansan
    @_mvansan 2 года назад

    thank bro :D

  • @Rajat-qo7ot
    @Rajat-qo7ot 4 года назад

    Hello friends ,lol