[Nauty] isomorphism of graphs generated by geng

[Sterten at aol.com]

you could create the lexicographically minimal graph from each  class.
This should ensure that the requirement with the edges is  satisfied.
(does it really? delete the last 1 in the upper triangle..will it work  
always ?)
That method is preferrable for some other reasons too.
I  wrote such a program some years ago, before I learned to
use Nauty. It's much  slower than Nauty, of course, and
n=10 could be already too large, but I  remember that I used
it go generate all graphs with 9 vertices  correctly.
 
Guenter.



In einer eMail vom 26.06.2005 09:46:30 Westeuropäische Sommerzeit schreibt  
gordon at csse.uwa.edu.au:

>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





-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.anu.edu.au/mailman/private/nauty/attachments/20050626/d69ee3ef/attachment.html