A theorem which determines the number of spanning trees in a graph. Let A be the adjacency matrix of a graph G with n vertices and let L = D – A where D is the diagonal matrix whose entries are the degrees of the vertices. Then the number of spanning trees equals c1/n, where c1 is the coefficient of x in the characteristic polynomial χL(x).