edited by
17,382 views
62 62 votes
Let $G$ be a connected undirected graph of $100$ vertices and $300$ edges. The weight of a minimum spanning tree of $G$ is $500$. When the weight of each edge of $G$ is increased by five, the weight of a minimum spanning tree becomes ______.

8 Answers

Best answer
99 99 votes
First find no of edges in mst.
Mst has $n-1$ edges where $n$ is no of vertices. $100-1 =99$ edges
Each $99$ edges in mst increases by $5$ so weight in mst increased $99*5=495$
Now total weight of mst $=500+495=995$
edited by
6 6 votes
Since there are 100 vertices, there must be 99 edges in Minimum Spanning Tree (MST). When weight of every edge is increased by 5, the increment in weight of MST is = 99 * 5 = 495 So new weight of MST is 500 + 495 which is 995
4 4 votes

Adding or multiplying all the edges of an MST by a constant does not change the MST, it only changes the value of MST.

Vertices = 100.

Hence, edges in the MST = 99.

Weight = 500

 

Since the MST would remain the same; just the edge weights would be upgraded by 5, upgraded MST weight:

$500+99(5)=995$

0 0 votes
the formula is [total present cost] + [no.of edges * added amount] (just from repeated observations with various values, check for yourself)

total present cost is 500
no.of edges are n-1 = 99
added amount is 5

plug in the values we get 995
Answer:
Position:
Show:

Related questions

49 49 votes
5 answers 5 answers
14.9k
14.9k views
go_editor asked Feb 14, 2015
14,892 views
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
63 63 votes
5 answers 5 answers
21.3k
21.3k views
go_editor asked Feb 14, 2015
21,264 views
Consider the following statements.TCP connections are full duplexTCP has no option for selective acknowledgementTCP connections are message streamsOnly I is correctOnly I...
74 74 votes
3 answers 3 answers
26.6k
26.6k views
go_editor asked Feb 14, 2015
26,559 views
Consider the relation $X(P,Q,R,S,T,U)$ with the following set of functional dependencies$F = \{ \\ \; \; \{P, R\} \rightarrow \{S, T\}, \\ \; \; \{P, S, U\} \rightarrow \...
39 39 votes
4 answers 4 answers
15.4k
15.4k views
go_editor asked Feb 14, 2015
15,382 views
Consider the following array of elements.$\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$The minimum number of interchanges needed to convert it into a ma...