Hi,
As all of us knows number of spanning tree of simple labeled graph could be computed by the Kirchhoff's theorem.
But is there any other method (other than Brute force) to compute the number of spanning tree of given general graph ?
Formula for number of spanning tree possible in Simple Labeled Complete graph($K_{n}$) and Simple Labeled Complete Bipartite graph($K_{m,n}$) are $n^{n-2}$ and $n^{m-1}m^{n-1}$ respectively.
If anyone can state simple proof for above mentioned formula then it will great help.
