Is it possible for a graph to have two different minimum spanning tree
It is possible to have different minimum spanning trees for a graph. 
Consider a simple example: a cycle graph with all weights equal. Removing any edge from the graph produces a minimum spanning tree for the cycle graph.