Hi, can you give me a hint about this problem ??

Given a graph with n vertices and m edges, find the minimum number of operations required to remove the graph completely

in an operation you can do one of the following things:

1- remove a vertex from the graph

2- remove 2 vertices connecting to an edge