#16370: OA(k,n) strongly regular graphs
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_work
Type: | Milestone: sage-6.3
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | e3c1c2180178c94d883db945dc33f2b457330cbc
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/16370 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Yo !
> I think it would be misleading to call it a Steiner design graph, as an
incidence system can give rise to a graph in atleast three different ways:
HMmmm.... Well, my aim here was to implement a new class of strongly
regular graphs that appears on Brouwer's website. The constructions you
mention are interesting too but to me they really belong to the "design"
world while those here belong to the "graph theory world", even though the
meaning of this is a bit vague `:-P`
In my head it is more as if anybody who would want to build those other
graphs would go toward designs first, while in the latter case they would
go toward graphs OR designs.
Thus, we need a constructor for these particular strongly regular graphs.
AND we will need to add a BlockDesign.intersection_graph someday along
with the others
> Hope this is helpful.
Yep yep. It was a discussion about user interface almost from the
beginning.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#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.
For more options, visit https://groups.google.com/d/optout.
