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

http://gateoverflow.in/10154/find-out-the-no-of-spanning-tree-possible

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

Please log in or register to answer this question.



Top Users Jun 2017
  1. Bikram

    3912 Points

  2. Arnab Bhadra

    1526 Points

  3. Hemant Parihar

    1502 Points

  4. Niraj Singh 2

    1491 Points

  5. Debashish Deka

    1450 Points

  6. junaid ahmad

    1432 Points

  7. pawan kumarln

    1278 Points

  8. Rupendra Choudhary

    1242 Points

  9. rahul sharma 5

    1240 Points

  10. Arjun

    1228 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 26 - Jul 02
  1. pawan kumarln

    410 Points

  2. akankshadewangan24

    334 Points

  3. Arjun

    268 Points

  4. Abhisek Das

    230 Points

  5. Bikram

    208 Points


23,433 questions
30,147 answers
67,595 comments
28,476 users