MST bounds or theoretical limits

A question is this type if and only if it asks you to find minimum or maximum possible length of an MST given constraints on edge weights.

1 questions · Challenging +1.2

Sort by: Default | Easiest first | Hardest first
AQA D1 2009 January Q6
7 marks Challenging +1.2
6 A connected graph \(G\) has five vertices and has eight edges with lengths \(8,10,10,11,13,17\), 17 and 18.
  1. Find the minimum length of a minimum spanning tree for \(G\).
  2. Find the maximum length of a minimum spanning tree for \(G\).
  3. Draw a sketch to show a possible graph \(G\) when the length of the minimum spanning tree is 53 .