GATE CSE
First time here? Checkout the FAQ!
x
0 votes
138 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) 2 2 | 138 views

Please log in or register to answer this question.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23678 Points

  2. Bikram

    17278 Points

  3. Habibkhan

    8962 Points

  4. srestha

    6460 Points

  5. Debashish Deka

    5478 Points

  6. jothee

    5128 Points

  7. Sachin Mittal 1

    4892 Points

  8. joshi_nitish

    4486 Points

  9. sushmita

    4052 Points

  10. Rishi yadav

    3974 Points


Recent Badges

Popular Question makhdoom ghaya
Great Question makhdoom ghaya
Famous Question makhdoom ghaya
Notable Question PriDix
Popular Question ManojK
Reader Chandramani Adil
Regular qwerty007
Notable Question rishu_darkshadow
Popular Question Rishi yadav
Popular Question makhdoom ghaya
27,417 questions
35,262 answers
84,532 comments
33,497 users