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)   | 101 views

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.

Top Users Apr 2017
  1. akash.dinkar12

    3826 Points

  2. Divya Bharti

    2796 Points

  3. Deepthi_ts

    2294 Points

  4. rude

    2142 Points

  5. Prashant.

    1900 Points

  6. Tesla!

    1888 Points

  7. Kapil

    1842 Points

  8. Debashish Deka

    1830 Points

  9. Arjun

    1810 Points

  10. Sanjay Sharma

    1712 Points

Monthly Topper: Rs. 500 gift card

22,177 questions
28,200 answers
24,364 users