General solution to the spanning tree enumeration problem in multigraph wheels

A recurrence relation and an explicit solution for the number of spanning trees in a multigraph wheel with unequal numbers of spokes and rim edges are given. Previous results can be identified as special cases of the general enumeration and the solution for one new specific case is included.