# How to generate computational data in graph theory?

For a given number of nodes how many non-isomorphic graphs are available? Might be this is an open problem. For less number of vertices some computational statistics available.

I want to get all non-isomorphic graphs of order $5, 6, \dots 12$. Is there any complete list of all non isomorphic graphs available for a given number of nodes? If possible please give me its links or some references.

If I wish to calculate it myself, which software package may be useful?