What information does the automorphism group $\mathrm{Aut}(G)$ of a graph $G$ give us about the number of it's spanning trees?

If not in general, can anything be said about some special cases, for example, when $\mathrm{Aut}(G)$ is the symmetric group $S_r$ for some $r\leq |V(G)|$?