The maximum possible weight that a minimum weight spanning tree of G can have

Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of Gcan have is _______

1Comment
shivanisrivarshini shivanisrivarshini 11 Mar 2018 02:26 pm
7