[Nauty-list] digraph-->graph

[Mathieu Dutour]

One way is to duplicate the number of vertices.
Any vertex a is associated to a pair a, a'.

A directed edge a ---> b becomes an undirected
edge {a, b'}.
We associate color 0 to all vertices x and color 1
to all vertices x'.

  Mathieu


On Sat, Oct 19, 2013 at 5:53 PM, <Sterten at aol.com> wrote:

> **
> how did we best make a graph from a digraph with isomorphic automorphism
> group ?
>
> _______________________________________________
> Nauty-list mailing list
> Nauty-list at cs.anu.edu.au
> http://dcsmail.anu.edu.au/cgi-bin/mailman/listinfo/nauty-list
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.anu.edu.au/mailman/private/nauty/attachments/20131019/4fd38ece/attachment.html