Hello Everyone, I'm trying to find the minimum diameter spanning tree of a graph , I find some solutions that said that the minimum diameter is the diameter of the shortest path tree rooted at the center of the tree , but i dont know how to prove it . Any Help