Express the number of spanning trees in term of degrees

Abstract

It is well-known that the number of spanning trees, denoted by τ (G), in a connected multi-graph G can be calculated by the Matrix-tree theorem and Tutte's deletioncontraction theorem. In this short note, we find an alternate method to compute τ (G) by degrees of vertices.