It is well discussed in many graph theory texts that it is somewhat hard to distinguish non-isomorphic graphs with large order. But as to the construction of all the non-isomorphic graphs of any given order not as much is said. So, it follows logically to look for an algorithm or method that finds all these graphs. 


A Google search shows that a paper by [P. O. de Wet](http://www.moreheadstate.edu/files/colleges/science/mcs/mejam/dewet.pdf) gives a simple construction that yields approximately $\sqrt{T\_n}$ non-isomorphic graphs of order n.


( $\{T\_n}$ being the number of labeled graphs of order n.)


So, I have the followings to ponder over: 


(1) Are there such algorithms or has there been an improvement on the aforementioned algorithm?


(2) Where can I find a collection of non-isomorphic graphs of a given order? 


If you allow me, I would also like to extend my question to connected graphs. 


Many thanks. 


(I am a beginner in Graph theory, so please give answers in not-very-specialized terms.)



Non-isomorphic graphs of given order.
Acknowledging Timothy’s comment, let me answer the question.


For a diagrammatic list of the non-isomorphic graphs (all in pdfs):


1. <http://keithbriggs.info/images/g4.pdf>
2. <http://keithbriggs.info/images/g5.pdf>
3. <http://keithbriggs.info/images/g6.pdf>
4. <http://keithbriggs.info/images/g7.pdf>
5. <http://keithbriggs.info/images/n8m9.pdf>
6. <http://keithbriggs.info/images/g10-8.pdf>
7. [Small graphs](http://www.research.att.com/~njas/sequences/a000088a.gif)


I [quote](http://keithbriggs.info/cgt.html) “The topologies were computed using the [nauty](http://cs.anu.edu.au/%257Ebdm/nauty) program by Brendan McKay and the layouts created with [graphviz](http://www.research.att.com/sw/tools/graphviz/). I wrote python programs to interface these and produce the pdfs.”


