#14532: Symplectic graphs
-------------------------------------------+--------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: closed
Priority: major | Milestone: sage-5.10
Component: graph theory | Resolution: fixed
Keywords: strongly regular graphs | Work issues:
Report Upstream: N/A | Reviewers: Frédéric Chapoton
Authors: Nathann Cohen | Merged in: sage-5.10.beta4
Dependencies: #14217 | Stopgaps:
-------------------------------------------+--------------------------------
Comment (by dimpase):
Replying to [comment:23 ncohen]:
> > Isn't it obvious?
>
> What do you use them for ? What do you want to compute ? Graphs have a
lot of method, you know.. `:-P`
Obviously, regularity properties - and this is very fast with such data.
Then, e.g.,
e.g. maximum cliques, or an optimal colouring. It's downright hopeless to
do without taking symmetries into account.
Or Lovasz theta number...
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14532#comment:25>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
