Number of spanning trees on a complete graph without a tree?

176 Views Asked by At

Say we have the complete graph on $n$ vertices, $K_n$, and a spanning tree $T$ of it. Can we say something about the number of spanning trees on the graph formed by removing the edges of $T$ from the edges of $K_n$?