See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

## 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|

------------------------------------

## Use Me ?