#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: | 90a72bd39d74c24cb548e5b7dc5995c67ac386f8
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/16370 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Hi there,
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.
- http://www.win.tue.nl/~aeb/graphs/S.html.
- http://www.win.tue.nl/~aeb/graphs/STS.html
and even more generally, it is written that ''the block graph of a quasi-
symmetric design is strongly regular.''
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:20>
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.
