Hi,I just encountered problems about calculation of the number of spanning trees,like this one:
https://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?
