Question

(b) Find a minimum-weight spanning tree in the following graph.

Image ignouacademy-com--p-graph-85898

29 Apr 2025
Answer :
Word Count : 423
To find a **minimum-weight spanning tree** (MST) in the given weighted graph, let’s apply Kruskal’s algorithm step by step: *** ## Step 1: List All Edges With Weights Let’s label the vertices for reference: $$v_1, v_2, v_3, v_4, v_5, v_6, v_7, v_8$$. List the edges and their weights (read from the image): - $$ v_1v_2: 3 $$ - $$ v_1v_6: 6 $$ - $$ v_1v_7: 5 $$ - $$ v_2v_3: 2 $$ - $$ v_2v_6: 6 $$ - $$ v_3v_4: 1 $$ - $$ v_3v_5: 2 $$ - $$ v_3v_6: 4 $$ - $$ v_4v_5: 6 $$
________ __________ ___ ___ ________ _____ _____.
_______ ________ __________ _________ ______ ______.
___ __________ _________ _________ _______ ________ _______ ____ _____ _____ ____.
_________ ______ _________ __________ ____.
_________ _________ ______ ______ _______ ___ ________.
_________ __________ ____ _______ ______ _______ _________ ____ _______ ____ __________ __________.
__________ _______ _____ ________ ___ _____ __________ ___ __________ ___.
_______ ____ ______ ____ ______ ______ __________ _____.
_______ _____ _________ ______ _________.
______ _____ ______ ______ ____ ______ __________ _______ ______ ________ _____.
_________ _________ _______ __________ ________ __________.
_____ _______ _________ _______ ______ ___ ___ ______.
_______ _________ ___ __________ ________ __________ _____ _________ ______.
_____ _____ _________ _________ ________ ________ _____ __________ _________ _______.
______ _______ ____ _______ ________ ____.
____ ___ _________ __________ ________ ________ __________ ____ _____.
__________ ________ _________ _____ _____ _____ ______ ________ __________ ________ _________.
__________ __________ ________ _____ _________ ______.
___ _______ ______ ____ ______ ______ ___ _______ __________ _______ _________.
___ ________ _________ ______ ________ _______ ____ ___ _________.
__________ ___ ____ ______ ____ ________ __________.
___ ________ _____ ______ ________ ________ ______ _______.
__________ _____ _________ ____ _____ _____ ___ _______ _____ ________ ______.
___ ______ __________ _________ ______ ______ _______ ___ ______ ___ _____ __________.
________ ___ _____ ___ _________ __________ ______.
_________ __________ __________ ___ ____ ______.
__________ __________ ____ ________ ________ ___ ________ ___.
_______ _______ _____ ________ _____ _____ _______ _____ __________ ___.
_____ ______ ____ _______ ____.
__________ _____ ___ ______ ___ ______ ______.
___ _________ _________ _____ ____ __________.
_______ _________ _________ ____ ________ ______.
_______ ______ _________ _________ ____ ____ ______ ___ ________ ____.
___ ________ _________ _________ ______ _____.
____ ________ _________ _____ _______.
_______ ______ __________ ____ ________ ________ ________.
_______ _____ _____ ________ _____ __________ ________ ______ __________ ________.
________ _____ ___ _________ _________.
_____ _____ _________ ___ ___ ______ _______ _______ _____ ______ _____.
_______ ___ ____ ______ _______ _________ _____ _________ _______ _______ ______ _________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MMTE 1 2025 - (b) Find a minimum-weight spanning tree in the following graph. | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→