618 views

2 Answers

0 votes
0 votes

Using Kruskal Algo

9---10 =2

7-----8 =2

9------5=3

5------6=3

3------4=3

8----12=3

2-----6 =4

6-----11=4

11--12 =5

5------1=6

4-----8 =6

answer= 2+2+3+3+3+3+4+4+5+6+6 =41

Related questions

2 votes
2 votes
2 answers
2
Arjun asked Feb 16
2,220 views
The number of spanning trees in a complete graph of $4$ vertices labelled $\text{A, B, C,}$ and $\text{D}$ is _________.