The Gateway to Computer Science Excellence
0 votes
Let G be a weighted undirected graph and e be an edge with mazimum weight in G. suppose there is a minimum weight spanning tree in G containing edge e. which of the following statements are always true?

A) There exists a cutset in G having all edges of maximum weight

B) There exists a cycle in G having all edges of maximum weight

C) Edge e cannot be contained in a cycle

D) All edges in G have the same weight
closed as a duplicate of: GATE2005-IT-52
in DS by Boss (11k points)
closed by | 83 views
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,741 questions
57,252 answers
104,698 users