A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree
We show that the number of vertices of degree k in the Euclidean minimal spanning tree through points drawn uniformly from either the d-dimensional torus or from the d-cube, d > 2, are asymptotically equivalent with probability one. Implications are discussed.
Massachusetts Institute of Technology, Operations Research Center
Operations Research Center Working Paper;OR 235-90