Drawing all five vertex graphs

[moijjo]

I have an exercise: "Draw all five vertex graphs (when an appropriate level of graph edges intersect, sketch isomorphic with the graph whose edges do not intersect)."

I found those 3 pages, that I think are on topic on solving this...
* http://www.graphclasses.org/smallgraphs.html#nodes5
* http://wiki.smp.uq.edu.au/G-designs/ind ... e_vertices
* http://3.bp.blogspot.com/-vKVJP-EA2WM/U ... aphlet.jpg

But what would be the actual correct answer to that question? A mix of all 3 sources? Only one of them? Something else?

 

[HallsofIvy]

The first two are the same. The third is not relevant because it gives "graphlets", not "graphs"- that is, it does not contain non-connected graphs. The first has 34 graphs while the second has 29 because the second does not include graphs that are isomorphic to graphs given earlier.

 

[pka]

I have an exercise: "Draw all five vertex graphs (when an appropriate level of graph edges intersect, sketch isomorphic with the graph whose edges do not intersect)."

I found those 3 pages, that I think are on topic on solving this...
* http://www.graphclasses.org/smallgraphs.html#nodes5
* http://wiki.smp.uq.edu.au/G-designs/ind ... e_vertices
* http://3.bp.blogspot.com/-vKVJP-EA2WM/U ... aphlet.jpg

But what would be the actual correct answer to that question? A mix of all 3 sources? Only one of them? Something else?

I have no real idea what Draw all five vertex graphs (when an appropriate level of graph edges intersect, sketch isomorphic with the graph whose edges do not intersect)." means exactly.
At first I read it as meaning 'Draw every planar graph of degree five'.
If that were correct it would be the most awkward way of asking the question.
Thus I really don't understand the wording.
Can you make it clear?