First time here? Checkout the FAQ!
0 votes
Hi,I just encountered problems about calculation of the number of spanning trees,like this one:

I am able to proceed to choose the number of edges.But I am unable to understand the calculation of the number of cycles to subtract.Can anyone help me in understanding the same?Also,Kirchoffs theorem leads to calculation of large determinants for such problem,which is not feasible.Are you aware of any other method to do the same?
asked in Algorithms by (15 points)   | 99 views

Please log in or register to answer this question.

Top Users Mar 2017
  1. rude

    4758 Points

  2. sh!va

    3014 Points

  3. Rahul Jain25

    2830 Points

  4. Kapil

    2636 Points

  5. Debashish Deka

    2442 Points

  6. 2018

    1514 Points

  7. Vignesh Sekar

    1416 Points

  8. Akriti sood

    1298 Points

  9. Bikram

    1286 Points

  10. Sanjay Sharma

    1076 Points

Monthly Topper: Rs. 500 gift card

21,471 questions
26,802 answers
23,037 users