#19136: NO and NU graphs
--------------------------------+------------------------
Reporter: dimpase | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------+------------------------
Comment (by dimpase):
Replying to [comment:1 ncohen]:
> You know how to build those ? COOL `O_O`
most of it should be trivial modifications of polar graph functions.
I think I also should do refactoring of `graphs/generators/families`
here...
>
> They are like the main race of the graphs that we still can't build.
there still `skewhad*` and `Pasechnik`, which need some skew-Hadamard
matrices...
These still need few not too trivial constructions by Williams to be
implemented.
--
Ticket URL: <http://trac.sagemath.org/ticket/19136#comment:2>
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.
