• edited by
28,644 views
82 82 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

7 Answers

0 0 votes
T and T' can be diffrent because MST need not be unique suppose there are 2 edges with same weight then we can draw different MST's if in question it would have been given distinct weight then ofocurse T = T' but since not mentioned T may not be equal T'

2 . sum of squares is always less than squared sum of numbers ( 1 + 2 + 3 ) **2 = 36 > 1**2  + 2**2 + 3**2 = 36 > 13 so t' < t**2

Since no option matches given answer is D
Answer:
Position:
Show:

Related questions

180 180 votes
12 answers 12 answers
55.5k
55.5k views
gatecse asked Sep 12, 2014
55,483 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...
65 65 votes
6 answers 6 answers
20.4k
20.4k views
gatecse asked Aug 5, 2014
20,422 views
What will be the output of the following C program segment?char inChar = 'A'; switch ( inChar ) { case 'A' : printf ("Choice A \ n"); case 'B' : case 'C' : printf ("Choic...
133 133 votes
18 answers 18 answers
45.7k
45.7k views
gatecse asked Sep 26, 2014
45,739 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...
73 73 votes
3 answers 3 answers
19.5k
19.5k views
gatecse asked Aug 21, 2014
19,481 views
Which one of the following is NOT logically equivalent to $¬∃x(∀ y (α)∧∀z(β ))$ ?$∀ x(∃ z(¬β )→∀ y(α))$$∀x(∀ z(β )→∃ y(¬α))$$∀x(∀ y(α)→∃z(¬β ))$$∀x(∃ y(¬α)→∃z(¬β ))$