Minimum number of spanning tree

Question

For finding minimum number of spanning tree using kirchoff rule we construct adjacency matrix and find cofactors.

so my question is what if we have 6*6 matrix or more than that then how to solve it .

Comments

Keep it simple,,,1.make adjacency matrix, replace diagonal element by degree of node,1's by -1 and keep non diagonal 0's as it is,then find cofactor of any element of matrix,,

Answer 1

You can solve it too:-

https://www.enotes.com/homework-help/calculate-determinant-this-6by6-matrix-1-1-0-0-0-0-117475