Question 132Asked in CIL MT Systems, 26 Mar 2017 (12:30 PM)

Consider the following Adjacency matrix corresponding to some weighted Graph 'G' (rows and columns are vertices 1 to 5).

Consider the following Adjacency matrix corresponding to some weighted Graph 'G' (rows and columns are vertices 1 to 5). Vertex 1: 0 5 0 10 2 Vertex 2: 5 0 4 6 2 Vertex 3: 0 4 0 1 0 Vertex 4: 10 6 1 0 7 Vertex 5: 2 2 0 7 0 What is the weight of the minimum spanning tree for the graph 'G'?
  1. A11
  2. B9
  3. C10
  4. D8
Show answerHide answer

Correct answer: (B) 9

From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)

This is question 132 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.