Got it, thanks anyway.
How could I go about determining how many non isomorphic spanning trees
kn would have?
Is there a particular formula involved that I am not seeing, or is it simply a process of creating the spanning trees and then discarding those that aren't isomorphic?
I found the formula to determine how many unique spanning trees would exists but this doesn't little towards isomorphism.