#19586: Add is_cayley_graph
-------------------------------------+-------------------------------------
Reporter: jaanos | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.1
Component: graph theory | Resolution:
Keywords: Cayley graphs | Merged in:
groups | Reviewers: Nathann Cohen
Authors: Janoš Vidali | Work issues:
Report Upstream: N/A | Commit:
Branch: | a58a7348bc022f39bf68383b70400e8b7f5b268b
u/jaanos/add_is_cayley_graph | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jaanos):
Hi!
Replying to [comment:86 ncohen]:
> I believe we should stick to the seemingly widespread definition and
only allow connected ones.
I see... but an easy solution to this would be to add an
`allow_disconnected` parameter. Then the recursive call on the complement
would set this to `True` - the original setting only matters for the
initial graph, anyway.
What about non-simple graphs? I don't think the definitions say much about
those, so we're probably good? Although the Wikipedia article linked above
does say that a Cayley graph does not contain loops...
Janoš
--
Ticket URL: <http://trac.sagemath.org/ticket/19586#comment:87>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
