Deriving c(T)

• Every spanning tree on n vertices has n-1 edges. Hence, the average number of edges per vertex is d = 2(n-1)/n, about 2.

• Let di be the degree of vertex i. The variance in degree is

• Minimizing the variance is equivalent to minimizing

Previous slide

Next slide

Back to first slide

View graphic version