GATE CS 2018 (Forenoon) — Question 57

AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)NAT2 marksMedium

Consider the following undirected graph G:
Question image
Choose a value for \(x\) that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of \(x\) is ______.
Practise the full 2018-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Minimum Spanning Trees (Prim/Kruskal Algorithms)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group