A number of problems from graph theory are called Minimum spanning tree . There may be several minimum spanning trees of the same weight having a minimum number of edges ; in particular , if all the edge weights of a given graph are the same , then every spanning tree of that graph is minimum .