[Nauty] A question.

[Gordon Royle]

For relatively simple "one-off" tasks like this, I would just use 
"dreadnaut" which Brendan has supplied as a simple interactive 
"front-end" for nauty that does not involve any programming or 
knowledge of nauty's internal representations etc.



Step 1: Start up dreadnaut

Dreadnaut version 2.2 (32 bits).
 >

Step 2: Tell it how many vertices by typing n=<number of vertices>

 > n=5

Step 3: Enter the graph by typing g and then answering each prompt with 
the neighbours of the vertex (remember to start from 0) ending each 
line with a semicolon ;

 > g
  0 : 1 2;
  1 : 3;
  2 : 4;
  3 : 4;
  4 : ;


Step 4: Type "x" to run nauty

 > x
(1 2)(3 4)
level 2:  3 orbits; 1 fixed; index 2
(0 1)(2 3)
level 1:  1 orbit; 0 fixed; index 5
1 orbit; grpsize=10; 2 gens; 6 nodes; maxlev=3
tctotal=9; cpu time = 0.00 seconds
 >


Of course, if you are doing a bigger graph, then you probably don't 
want to enter it by hand, but then you can just write a little program 
that turns an adjacency matrix into the right format for dreadnaut, and 
then pipe that into dreadnaut