Q. 29 Let G be a weighted graph with edge weights greater than one and G’ be the
graph constructed by squaring the weights of edges in G. Let T and T’ be the
minimum spanning trees of G and G’, respectively, with total weights t and t ‘.
Which of the following statements is TRUE?
(A) T’ = T with total weight t’ = t2
(B) T’ = T with total weight t’ < t2
(C) T’ != T but total weight t’ = t2
(D) None of the above
Answer: (D)
Explanation:
