The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
195 views

An undirected graph G (V, E) contains n (n > 2) nodes named v1 , v2 ,...,vn. Two nodes vi and vj are connected if and only if 0 < │ i − j│ ≤2. Each edge (vi , vj ) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is:

A) 88 B)91 C)49 D)21

in Graph Theory by Active (4.9k points)
recategorized by | 195 views
0
It's B, I think.
+4

by substituting n=10, you get 100-10+1 = 91 ==> Option B is correct

0

nice explanation  Shaik Masthan

0
very good Explanation ....Thanks

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,362 questions
55,787 answers
192,412 comments
90,920 users