how many non-isomorphic graphs are there with 5 vertices and 3 edges?
Maybe ask a few easier questions.
How many non-isomorphic graphs with 5 vertices and 3 edges contain $K_3$ as a subgraph?
How many non-isomorphic graphs with 5 vertices and 3 edges are connected?
How many non-isomorphic graphs with 5 vertices and 3 edges have more than 2 connected components?
I agree with the comments that suggest you should draw pictures, try this for smaller values, and explain what you have tried so far. I'm hesitant to give a more complete answer since this seems likely to be a homework question.
The following are not isomorphic for sure.
As you can see further induction using the preservation of degree principle will not work, since the next stage would suggest 6v of deg 1 which violates the conditions.
My book answer suggests there is another graph, but I cannot find the last one, so I guess my logic is stuck somewhere, but I hope this helps so far.