Dear Bizhan,
On Mon, Mar 24, 2014 at 03:37:59AM -0700, Bizhan Irani wrote:
> I am student in PHD. of mathematics.
> Is there program of G-arc-transitive Graph(X) in sage software(G<
> Aut(X))??
> I would appreciate it if you have helped me. Ofcourse, i write the
> following program. Do you help me to complete this program(please)?
>
> For a graph X and a subgroup G of Aut.(X), X is said to be
> G-arc-transitive if G is transitive on
> arcs of X .
>
> # Find the G-arc-transitive of graph X.
> X= Graph
> A(X)= X.arcs={a1,a2,a3,...,an}
> f=X.automorphism()
> M= gap(f).AllSubgroup={m1,m2,...,mh}
> For 1 =< k =< h
> For 1 =< i =< n, 1 =< j =< n
> If ai . Mk = aj
> print Mk, Mk is arc-transitive
> else
> print Mk is not arc-transitive
> k=k+1
> end
> end
Interestingly enough, someone just asked the same question on
sage-combinat-devel, so I am CC'ing there:
https://groups.google.com/d/msg/sage-combinat-devel/NhHdYxW4LdY/w3NRBOu9hgAJ
Hmm, working on assignments for the same class maybe?
By the way, if you want to motivate people to answer, I recommend
showing off your own motivation. For example:
- Be explicit about what the program is supposed to do (input, output,
example, ...)
- Follow the Python tutorial if you have not done so yet.
- Translate as much as possible of the above algorithm into a Python
program.
- Be explicit about what problem you encounter with your program.
- ...
Best regards,
Nicolas
--
Nicolas M. Thiéry "Isil" <[email protected]>
http://Nicolas.Thiery.name/
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-combinat-devel.
For more options, visit https://groups.google.com/d/optout.
