A complete, undirected, weighted graph G is given on the vertices {0, 1, …, n…

PYQ GATE 1996

A complete, undirected, weighted graph G is given on the vertices {0, 1, …, n − 1} for a fixed positive integer n. Draw the minimum spanning tree of G if:

(a) the weight of the edge (u, v) is |u − v|;