#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):
1. If I understand correctly, modifying the code to make use of edge
labels would break in the following scenario
{{
sage: G = graphs.PetersenGraph()
sage: L = G.line_graph()
sage: L.is_arc_transitive()
}}
If so, then I believe this is a serious limitation that needs to be
solved. I can see many real life scenarios in which one needs to these
types of things on line graphs.
2. I agree! I am for both options depending on what others think.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13721#comment:5>
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.
