# A spanning graph

Given a weighted complete graph $$G$$ on the vertex set $$(v_{1}, v_{2}, \ldots, v_{n})$$ such that the weight of the edge $$(v_{i}, v_{j})$$ is $$2|i-j|$$, what is the weight of a minimum spanning tree of $$G$$?

×