SPANNING TREES AND ASPECTS OF CLUSTERING
Lawrence J. Hubert · British Journal of Mathematical and Statistical Psychology · 1974
The concept of a spanning tree for a weighted graph is used to characterize several methods of clustering a set of objects. In particular, most of the paper is devoted to stating relationships between spanning trees, single‐link and complete‐link hierarchical clustering, network flow and two divisive clustering procedures. Several related topics using the notion of a spanning tree are also mentioned.