[Nauty] isomorphism of graphs generated by geng

[Gordon Royle]

I have a listing of all the graphs on up to 10 vertices, each  
represented by a 45-character string of 0s and 1s, being the upper  
triangle of the adjacency matrix, with the property that deleting the  
last occurring 1 from any string gives another string in the list...

I computed this on a once-off basis for a particular reason, but if  
it would be of use to you, you would be welcome to use it.

Gordon