How many undirected graphs are there with N vertices, at least one vertex being isolated?

Question

I got this qustion in a test, the answer says N * 2^((N-1)*(N-2)/2), because for each of the N vertices, it calculates the number of undirected graphs with N-1