I'd like to find an explicit formula of the number of the spanning trees of complete bipartite graph, i.e.
$$k(K_{m,n})$$
How can I deal with it?
Any hint to proceed?
note Especially, the one exploiting the result of Temperley's fomrula would be my preference.