#13721: Additional tests for graph symmetries and an improvement of
is_vertex_transitive
----------------------------------+-----------------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Jernej Azarija | Merged in:
Dependencies: | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by azi):
Hello ncooohen!!1
Thank you for the review. Let me answer the points as posted by you.
1. I am not sure if this can be done without computing the automorphism of
the group. Note however that the resulting group is represented with
generators and is probably not that expensive. I have no clue what the
partition thing is meant to do (most likely something related to the
previous version of the code that computed orbits). What exactly do you
mean by refined partition? I don't understand this part.
2. I agree. Though I am not sure how to get the orbit for an action that
acts on edges (not on vertices.) I am not sure this is possible. Can
someone verify this?
3. That is a good point! This could be solved by having an optional
argument that supplies the automorphism group to the named functions!
4. Hahaha agree about the wording - I am waiting for the right time to
tell it to someone IRL :-)
5.
6. This should most likely be moved to Graph.py
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13721#comment:7>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
