#19586: Add is_cayley_graph
-------------------------------------+-------------------------------------
Reporter: jaanos | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.10
Component: graph theory | Resolution:
Keywords: Cayley graphs | Merged in:
groups | Reviewers:
Authors: Janoš Vidali | Work issues:
Report Upstream: N/A | Commit:
Branch: | 2e14f6959299bbcca913eef22822ae9c51b2fc84
u/jaanos/add_is_cayley_graph | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jaanos):
Hi!
Testing with the example in the docstring (5*Paley(9)) confirms that there
is a big difference in running times. The reason is of course that
disconnected vertex-transitive graphs will have a very large group of
automorphisms, and GAP will take very long to compute the lattice of
subgroups. So, in most cases it will be cheaper to do the check for a
connected component, and then inflate the certificate if requested (what
the method actually does is return the direct product of the group for a
connected component and a cyclic group).
Janoš
--
Ticket URL: <http://trac.sagemath.org/ticket/19586#comment:12>
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 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-trac.
For more options, visit https://groups.google.com/d/optout.
