[Nauty] Finding all the permutations (elements) of Aut(G)

Brendan McKay bdm at cs.anu.edu.au
Thu Oct 28 23:59:01 EST 2004

There is some code in the file naugroup.c that can produce all the
automorphisms of a graph.  The method of use is illustrated in
nautyex3.c.  Basically you write a procedure that accepts a permutation,
then that procedure will be called for each automorphism.  For your
application, that procedure can convert the automorphism into its
action on ordered pairs or whatever.  

It would be a good idea to get the latest nauty edition from the
nauty page (see below) before trying this.


* Rajesh Pavan Sunkari <pavan at Glue.umd.edu> [041028 02:47]:
> Hello,
> This is really a very basic question.
> I want to know how one could write a program which would output the set of
> permutations of Aut(G). I want these permuatation to act on some other
> objects(say just ordered pairs (1...n)). I dont want these permutations
> (elements of group) written into a file instead I want to have them
> dynamically because I would have to do this operation for lot of graphs
> generated by geng.
> There was a similar question ("How to apply automorphisms") posed by Aisha
> Fenton but the solution she got was very specify to her problem.
> Your help is very much appreciated.
> Thanks,
> Pavan.
> _______________________________________________
> This is the nauty mailing list
> Post messages to nauty-list at cs.anu.edu.au
> nauty page: http://cs.anu.edu.au/~bdm/nauty/
> list page: http://cs.anu.edu.au/mailman/listinfo/nauty-list

More information about the Nauty mailing list