Consider a weighted complete graph G on the vertex set {v1, v2,............., vn} such that the weight of the edge (vi, vj) is 2 |i - j| . The weight of a minimum spanning tree of G is:
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is th...
- Let G be a weighted graph with edge weights greater than one and G' be the graph constructed by squaring th...
- What is the weight of a minimum spanning tree of the following graph? ![GATE 2003 Paper][1] [1]: http://i.i...
- What is the weight of a minimum spanning tree of the following graph? ![GATE 2003 Paper][1] [1]: http://i.i...
- Consider a minimum spanning tree T in a graph G. If the weight of an edge e of T is decreased, then the res...
- An undirected graph G(V,E) contains n ( n >2 ) nodes named v1 , v2 ,....vn. Two nodes vi , vj are connected...
- Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific ed...
- Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific ed...