Data analysis implications of some concepts related to the cuts of a graph

Connections are pointed out between the concept of a cut in a graph and the data analysis problems of hierarchical clustering and seriation encountered in the social and behavioral sciences. An emphasis is placed on hierarchical clustering by the criterion of k-edge connectivity and on the relationship between several criteria for object seriation proposed in the literature and the appropriate graph-theoretical structures.