Based on Kirchhoff matrix tree theorem, a research has been conducted on the number of spanning trees of some special graphs. With the Kirchhoff matrix corresponding to the dual graph of planar graph combined together, the recursive relation equation can be worked out, thus obtaining the general formula of the number of spanning trees as well.