Find a connected weighted simple graph with the fewest edges possible that has more than one minimum

Question:

Find a connected weighted simple graph with the fewest edges possible that has more than one minimum spanning tree.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: