if G is a connected, weighted graph and no two edges have the same weight, does there exist a unique (one and only one) minimum spanning tree for G? Why?

Question

anonymous · Answer

wow, this class came far didn't it?

anonymous · Answer

i wish i could help because your questions are usually the most interesting, but i am afraid i have no idea what any of this means. 
take a look at the attachment, i hope it helps

anonymous · Answer

Well this is discrete math. hahah we totally didnt get far we just skipped around the book.
Thanks @satellite73 ill take a look at the document

kinggeorge · Answer

I'm afraid I'm not familiar enough graph theory either to help here.

anonymous · Answer

Thanks :)))