•A new graph-based clustering method using node cutting was proposed.•We present theoretical results that guarantee the robustness in selecting nodes.•The optimal cluster number can be determined by adjusting a sparsity parameter.•Comparison studies show that the proposed method outperformed existing methods.