#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 !
> For BIBD(v,k,1) there is another standard terminology which is Steiner
2-designs S(2,k,v). So if we care about the Brouwer table then we would
also add a `graphs.SteinerDesignGraph` instead of a BIBD one. More
generally all Steiner systems give strongly regular graphs.
As you saw I asked him to confirm that not all graphs of Steiner Systems
with t>2 were strongly regular graphs, as I see no reason why this shold
be true.
Which is also why I do not like "SteinerDesignGraph" but at the very least
"Steiner2DesignGraph", even though it "contradicts the terminology" we
already use, i.e. BIBD.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:24>
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.
