Tags: #theorem

Statement

for a weighted graph $G$,

where $\tilde{L}$ is any cofactor of the Laplacian (Kirchoff) matrix and the weight of the tree is defined as

Proof

The proof follows from Kirchoff's matrix tree theorem, as we may take each edge weight to be in ${\mathbb{Z}}_{\ge 0}$ and treat them as multiedges.