4 . Consider the following weighted graph :
Kruskal ’ s algorithm is used to find the minimum spanning tree for this graph .
( a ) Write down the adjacency matrix M of the subgraph with five vertices D , E , F ,
G and H only . [ 2 ]
( b ) State the edge of the smallest weight . [ 1 ]
( c ) By using the algorithm , find the minimum spanning tree . [ 4 ]
( d ) Write down the weight of the minimum spanning tree . [ 1 ]
9 www . seprodstore . com
131