ME Test Series

Question

The total number of MST possible  in below figure is _____

 

Comments

@Lakshman Patel RJIT n^(n-2) gives no of spanning trees , in the question it is asked for  number of minimum spanning trees, in this case weights of all edges are same in the question  , i.e  why no of minimum spanning trees =no of spanning trees, but if the edges weights were different the above formula n^(n-2)  wont be valid, right ??

---

see this

https://gateoverflow.in/202571/spanning-tree?merged=261720

https://gateoverflow.in/262827/self-doubt-spanning-tree

https://gateoverflow.in/170427/number-of-spanning-trees

---

but if the edges weights were different the above formula n^(n-2)  wont be valid

@ Shadan Karim yes. since all weights are equal and since it is complete graph that's why "no. of mst= no. of spanning tree"