Let G be a complete undirected graph on 4 vertices having 6 edges with weights being 1 2 3 4 5 and 6 The maximum possible weight that a minimum weight spanning tree of G can have is Gate cs 2016

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, We have just launched eduladder videos.Looking for creators and contributors Read Guideline
Gate-cs-2016-->View question


Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ____. Gate-cs-2016


fill in the blanks



By:13priya

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

Answer: (B) 
Explanation: One graph that has maximum possible weight of spanning tree(In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G, with minimum possible number of edges)


prajwalamv

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



New updates

Updated ProfileDate:2018-12-11 23:05:34Done by:imuxos

Updated ProfileDate:2018-12-11 22:55:51Done by:utitij

Searching for :answer is very very Sourav sirDate:2018-12-11 22:10:05Done by:Anonymous user(Visitor)

Similar Questions


Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ____. Gate-cs-2016
1 Answer

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
1 Answer

Let G be an undirected connected graph with distinct edge weight. GATE CSE 2000
1 Answer

The graph shown below 8 edges with distinct integer edge weights. -gate-cse-2015
1 Answer

Let G be a weighted graph with edge weights greater than one and Gbe the graph constructed by squaring the weights of edges in G. Let T and T be the minimum spanning trees of G and G, respectively, with total weights t and t. Which of the following i
1 Answer

Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements: -gate computer science 2017
1 Answer

Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest pat
1 Answer

Let G be the non-planar graph with the minimum possible number of edges. Then G has -computer science-gate-2007
1 Answer

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to A -gate-cse-2012
1 Answer

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-computer science-2012
1 Answer

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-cse-2012
1 Answer

how to find the number of bounded faces in an undirected graph?
1 Answer

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three? -gate-computer science-2012
1 Answer

Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _______________.-gate-cse-2015
1 Answer

Let G be a simple undirected planar graph on 10 vertices with 15edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to -gate-computer science-2012
1 Answer

Which of the following graphs has an Eulerian circuit? -computer science-gate-2007
1 Answer

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0. -gate computer science 2017
1 Answer

Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. -gate-cse-2015
1 Answer

In a survey work, three independent angles X, Y and Z were observed with weights WX, WY, WZ, respectively. The weight of the sum of angles X, Y and Z is given by: - gate civil 2017
1 Answer

Which of the following statements are TRUE? -gate-computer science-2013
1 Answer

Notes

Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-6

Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-10

Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-11

iCAR

Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-7

Data structure with C 10CS35 unit-5

Operating Systems [10CS53] unit-4

Data structure with C 10CS35 unit-8

Data structure with C 10CS35 unit-6

GRAPH THEORY AND COMBINATORICS(10CS42)

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

Join eduladder!