edited by
16,530 views
59 votes
59 votes

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?

  1. $T' = T$ with total weight $t' = t^2 $
  2. $T' = T$ with total weight $t' < t^2$
  3. $T' \neq T$ but total weight $t' = t^2$
  4. None of the above
edited by

5 Answers

0 votes
0 votes
Answer is D.

Take a complete graph with 3 vertices and each edge is 2. So if we square all, we still can have different types of mst than previous with same cost. Since all options are comparing T and T', they're all wrong, as we can't say. T and T' may or may not be equal. Hence D.
Answer:

Related questions

113 votes
113 votes
9 answers
5
gatecse asked Sep 12, 2014
35,056 views
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
72 votes
72 votes
14 answers
7
gatecse asked Sep 26, 2014
28,992 views
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...
46 votes
46 votes
3 answers
8
gatecse asked Aug 21, 2014
12,037 views
Which one of the following is NOT logically equivalent to $¬∃x(∀ y (α)∧∀z(β ))$ ?$∀ x(∃ z(¬β )→∀ y(α))$$∀x(∀ z(β )→∃ y(¬α))$$∀x(∀ y(�...