Distinct weights: $1$ (unique)

Cycle graphs: $n$

Complete graphs: $n^{n-2}$

Cycle graphs: $n$

Complete graphs: $n^{n-2}$

Dark Mode

1,451 views

18 votes

Best answer

14 votes

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 n^{n-2 }spaning trees (option e).

//up vote if you agree.