In a connected weighted graph with $n$ vertices, all the edges have distinct positive integer weights. Then, the maximum number of minimum weight spanning trees in the graph is
There will be unique min weight spanning tree since all weights are distinct.
Option is A.
OPTION a is correct
--> if all weights are distinct values then there exist unique min/max spanning tree.(option a)
Knowing the other option is also important while preparation ::
--> if graph is cyclic graph(n vertices) with same edge weights then there exist n spanning trees.(option b/c)
--> //y if graph is complete graph(n vertices) with same edge weights then there exist nn-2 spaning trees (option e).
//up vote if you agree.