GRAPE does need every graph to have a (possibly trivial) group of known
automorphisms.
To construct the trivial permutation group you use G := Group(()); or G :=
TrivialGroup(IsPermGroup);
TrivialGroup can also be used to make groups other than permutation groups.
Steve
On 20 Aug 2012, at 22:25, Gene Smith wrote:
> RequirePackage("grape");
> G := TrivialGroup(3);
> A := [[0,1,0],[0,0,1],[1,0,0]];
> Graph( G, [1..3], OnPoints, function(x,y) return A[x][y]=1; end,
> true );
_______________________________________________
Forum mailing list
Forum@mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum
