Enumeration of spanning trees in certain graphs

This correspondence gives a formula for the number of trees spanning any graph formed from a complete graph by deleting branches forming disjoint K-partite subgraphs.