The number of distinct minimum-weight spanning trees of the following graph is ________

Minimum Spanning Trees (MST) in GATE CS is tested heavily via theoretical properties (Cut and Cycle theorems), counting the number of distinct MSTs using Kruskal's stage-by-stage component logic, and parameterized/algebraic graph constructions. Questions frequently explore fundamental cycle edge swaps, algorithm time complexities for dynamic updates, and the structural relationship between graph shortest paths and tree paths.