Interesting graph problem. Help

Problem: Given an undirected graph of at most 48 nodes with at most 48^2 edges, what is the minimum of nodes that you need to remove in order to satisfy that none of the nodes is connected to any other. Time limit: 1 second. Note: Greedy doesn’t work. Brute doesn’t satisfy time limit.

You have to remove all the edges