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?

10Comments
Sumit Verma @sumitkgp
24 May 2017 11:50 am

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.

vaishali @vaisbhat
24 May 2017 02:53 pm

This is my result of solving only single factor i m getting result too

vaishali @vaisbhat
24 May 2017 02:55 pm

This was the question and i got such a large solution

Sumit Verma @sumitkgp
24 May 2017 03:17 pm

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

vaishali @vaisbhat
24 May 2017 03:26 pm
vaishali @vaisbhat
24 May 2017 03:31 pm

vaishali @vaisbhat
24 May 2017 03:32 pm

vaishali @vaisbhat
24 May 2017 09:10 pm
I guess images are still not visible properly so i have attached the link of question
Problem 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
vaishali @vaisbhat
25 May 2017 09:41 am

Hi @sumit please tell me how to reduce solution?

Sumit Verma @sumitkgp
25 May 2017 05:38 pm

@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.