4
It looks like magic because the proof of Kirchhoff's Matrix Tree Theorem is nontrivial.
It relies on several algebraic properties of the matrix constructed in steps 1-3, which is called the Laplacian matrix of the graph.
Let $A$ be the adjacency matrix, and let $D$ be the diagonal matrix with the degrees of the nodes on the diagonal. Steps 1-3 build the ...
Only top voted, non community-wiki answers of a minimum length are eligible
