[Nauty-list] permutation matrix output

[Adam Bohn]

Hi,

I am trying to find automorphisms of graphs in the form of
permutation matrices.  Specifically, I am looking at directed graphs,
and would like the output to be of the form of an n x n matrix, where n
is the number of edges of the graph, and the (i,j) entry is 1 if edge i
is mapped to edge j with the same direction, and -1 if i is mapped to j
with a change of direction.

I have read through the nauty manual
and cannot find any reference to computing automorphisms in the form of
permutation matrices.  Does anybody know if this is possible, or
whether there is another program with this functionality?

Thanks for any help.

Adam.


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