Suppose you have a complete undirected graph with 4 nodes. What is the maximum number of minimum spanning trees (MSTs) you can form?

Suppose you have a complete undirected graph with 4 nodes. What is the maximum number of minimum spanning trees (MSTs) you can form?

  1. a) 4
  2. b) 8
  3. c) 16
  4. d) 1

From the Janata Bank Assistant Network Engineer 2020 – Written exam, question 4 of 68.

More from this paper