Let w be the minimum weight among all edge weights in an undirected connected graph Let e be a specific edge of weight w Which of the following is FALSE computer science gate 2007
The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
Hey! Want to work with us? Our youtube channel See our Jd Want to apply? Do it today

Use Me  ?

New searches
GATE-Computer-Science-Engineering--Information-Technology-Question-Paper-with-Answer-key-2007-download-->View question


Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which of the following is FALSE?-computer science-gate-2007

Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which of the following is FALSE?
(A) There is a minimum spanning tree containing e.
(B) If e is not in a minimum spanning tree r. then in the cycle formed by adding e
to T, all edges have the same weight.
(C) Every minimum spanning tree has an edge of weight w.
(D) e is present in every minimum spanning tree.


By:Amogh

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

(D) e is present in every minimum spanning tree.
Explanation: (D) is incorrect as there may be many edges of wight w in the graph and e may not be picked up in some of the minimum spanning trees.

Aparna-Dasgupta

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!