Count alternative MSTs

A question is this type if and only if it asks you to state the number of other minimum spanning trees of the same length.

1 questions · Standard +0.3

Sort by: Default | Easiest first | Hardest first
AQA D1 2007 January Q1
10 marks Standard +0.3
1 The following network shows the lengths, in miles, of roads connecting nine villages. \includegraphics[max width=\textwidth, alt={}, center]{e47eb41e-0a4b-4865-a8ff-6c9978495ee0-02_856_1251_568_374}
  1. Use Prim's algorithm, starting from \(A\), to find a minimum spanning tree for the network.
  2. Find the length of your minimum spanning tree.
  3. Draw your minimum spanning tree.
  4. State the number of other spanning trees that are of the same length as your answer in part (a).