A note on fragile graphs Original Research Article

In this note, we show that every graph on n vertices and at most 2n−4 edges contains a vertex-cut S which is also an independent set of G. The result is best possible and answers a question proposed by Caro in the affirmative.