Bissoy.com
Doctors Medicines MCQs Q&A

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?

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? Correct Answer None of the above

The correct answer is “option 4”.

CONCEPT:

A spanning tree of graph G is a subset of G which has all vertices covered with the minimum possible number of edges.

Some properties of spanning tree are:

1. Spanning tree doesn’t contain any cycle.

2. Spanning tree cannot be disconnected.

Every connected and undirected graph G has at least one spanning tree.

EXPLANATION:

Consider graph G with edge weights > 1,

[ alt="F1 Raju S 19.5.21 Pallavi D1" src="//storage.googleapis.com/tb-img/production/21/05/F1_Raju%20S_19.5.21_Pallavi_D1.png" style="width: 182px; height: 134px;">

Consider graph G’ with squared edge weights of graph G,

[ alt="F1 Raju S 19.5.21 Pallavi D2" src="//storage.googleapis.com/tb-img/production/21/05/F1_Raju%20S_19.5.21_Pallavi_D2.png" style="width: 200px; height: 132px;">

The minimum spanning tree (T) of graph G is:

[ alt="F1 Raju S 19.5.21 Pallavi D3" src="//storage.googleapis.com/tb-img/production/21/05/F1_Raju%20S_19.5.21_Pallavi_D3.png" style="width: 171px; height: 137px;">

Minimum Spanning Tree (T’) of graph G’ is:

[ alt="F1 Raju S 19.5.21 Pallavi D4" src="//storage.googleapis.com/tb-img/production/21/05/F1_Raju%20S_19.5.21_Pallavi_D4.png" style="width: 182px; height: 137px;">

So, T is not equal to T'and t' < t2.

Hence, the correct answer is "option 4".

Related Questions

Let G be any connected, weighted, undirected graph. I. G has a unique minimum spanning tree, if no two edges of G have the same weight. II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut. Which of the above two statements is/are TRUE?
Let G be a connected undirected weighted graph. Consider the following two statements. S1: There exists a minimum weight edge in G which is present in every minimum spanning tree of G. S2: If every edge in G has distinct weight, then G has a unique minimum spanning tree. Which one of the following options is correct?
Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive and distinct. Consider the following statements: I) Minimum Spanning Tree of G is always unique. II) Shortest path between any two vertices of G is always unique. Which of the above statements is/are necessarily true?
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change
G = (V, E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE? I. If e is the lightest edge of some cycle in G, then every MST of G includes e II. If e is the heaviest edge of some cycle in G, then every MST of G excludes e 
The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
Consider the undirected graph below: Using Prim's algorithm to construct a minimum spanning tree starting with node a, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?
Consider a simple undirected weighted graph G, all of whose edge weights are distinct. Which of the following statements about the minimum spanning trees of G is/are TRUE ?
Let G be a simple undirected graph. Let TD be a depth first search tree of G. Let TB be a breadth first search tree of G. Consider the following statements. (I) No edge of G is a cross edge with respect to TD. (A cross edge in G is between two nodes neither of which is an ancestor of the other in TD .) (II) For every edge (u, v) of if u is at depth i and v is at depth j in TB , then |? − ?| = 1. Which of the statements above must necessarily be true?
One-sixth of the trees in a garden are neem trees. Half of the trees are Ashoka trees and the remaining are eucalyptus trees. If the number of neem trees is five, then how many eucalyptus trees are there in the garden?