https://uadoc.uacdn.net/doubts/8XMEB8T96H/1635570091WIYP5VIE.JPEG

IU
9.20.17 Spanning Tree: GATE CSE 2011 | Question: 54
An undirected graph G(
VE) contains n (n > 2) nodes named V1, V2, ..., Un. Two nodes Vi, u are connected
and only if <-< 2. Each edge (V;, v;) is assigned a weight i + j. A sample graph with n=
below
15
3
What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes?
A (11n- 5n) B. na-n +1
C. 6n - 11
D. 2n +1


English

Educator solution

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Doubt solution

Doubt details

CS & IT

AUTO-GENERATED

Solutions available

Educator solution