In particular, removal of the nodes participating in many triangles tends to separate the original graph into several connected components.
given a word u, we extract a network of its nearest neighbors from the synonymy graph G. Then, we remove the original word u from this network and run a hard graph clustering algorithm that assigns one node to one and only one cluster.