The matrix tree theorem, also called Kirchhoff's matrix-tree theorem, states that the number of nonidentical spanning trees of a graph G is equal to any cofactor of its Laplacian matrix.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.