Hi,
Can somebody please help me to find the number of non-isomorphic spanning trees in a simple complete graph Kn? Is there a formula to find it because suppose I have K5, it will take me forever to draw all its spanning trees...So if someone could give me some hints on how to compute the number of non-isomorphic spanning trees without actually drawing all possibilities, it would really help me!
Thanks for your time!