##### finding minimum number of spanning tree

As we know for finding minimum number of spanning tree we first construct adjacency matrix by applying kirchoff rule

So my doubt is how to solve or find cofactors for solution if we have 6*6 matrix or more than that any trick?

According to the Kirchhoff matrix theorem, all the cofactors of the matrix are equal and equal to the number of spanning trees of the graph. So you need to find only one cofactor and it is not a big deal with 6x6 matrix.

@vaisbhat none of the image is visible..please change the image properties.

Check out question at this link

http://gateoverflow.in/10154/find-out-the-no-of-spanning-tree-possibleProblem is that i am able to solve question and able to get correct answer by multiplying all diagonal elements but for making upper triangular matrix zero solution is too big.could you please solve that or tell me how to reduce it

Hi @sumit please tell me how to reduce solution?

@vaisbhat, I am unable to find any better method to get upper triangular matrix.

I must say, use other techniques to solve such problems instead of kirchoff rule.