closed by
413 views
0 votes
0 votes
closed as a duplicate of: GATE IT 2005 | Question: 52
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 by

Related questions

0 votes
0 votes
0 answers
1
Sankaranarayanan P.N asked Oct 27, 2016
319 views
The maximum number of edges in an acyclic undirected graph with n verticesA) n - 1B) nC) n +1D) 2n -1
0 votes
0 votes
0 answers
2
Sankaranarayanan P.N asked Oct 27, 2016
301 views
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree isA) 15B...
0 votes
0 votes
0 answers
3
Sankaranarayanan P.N asked Oct 27, 2016
362 views
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete no...