> < ^ Date: Mon, 23 Jun 1997 10:53:30 +0100
> < ^ From: Leonard Soicher <l.h.soicher@qmul.ac.uk >
^ Subject: Re: GRAPE and Graph theortic problems

Dear Javaid Aslam, Dear GAP-forum,

Dear Dr. Leonard Soicher,
Thank you for your detailed information on GRAPE.

I am trying to understand how to avoid the "group" argument in
Grape functions.

Well, that negates the whole GRAPE philosophy!

That said, you can always use the function Graph with the trivial
group to constuct a graph, but this can be much less efficient than
it need be. Also, given a graph gamma in GRAPE, you can determine
G:=AutGroupGraph(gamma); and then set gamma:=NewGroupGraph(G,gamma);
to associate G with gamma.

The problem I am working on involves some permutation properties
the given graph may have. For example, the count of certain permutations
contained in a regular bipartite graph.

I don't know what you mean.

It would be really helpful if you could possibly provide some hints on
how to construct any arbitrary (e.g. bipartite )graph and then use
grape/gap functions to analyse it. So far every function I have
seen, makes a reference to some group.

I emphasize: you cannot use GRAPE properly without understanding its
use of groups (even if you choose to use the trivial group)!

Also, I am unable to figure it out how to run a gap/grape program
from a file, instead of interactively (typing directly) programming.

Look up the documentation on the GAP functions Read and Edit.

Regards, Leonard Soicher.

> < [top]