A note on single-linkage equivalence

We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and “ultra-similarities”, and we discuss how it relates to the popular single-linkage clustering algorithm.