Counting Spanning Trees (Matrix-Tree Theorem and Cycle Multiplication)

The exact number of spanning trees is any cofactor of the Laplacian (Matrix-Tree), but for graphs glued at cut vertices the count simply multiplies block by block — a cycle of length k contributes a factor of k.