#16370: OA(k,n) strongly regular graphs
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.3
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | d1e272f81fbd464af0f46199faa3b3fb1eda2376
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/16370 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Hi,
Two non-isomorphic OA(k,n) might give isomorphic intersection graph
(exercise ;-P). I modified the documentation accordingly.
I put a `k'` for the parameters of the srg to avoid ambiguity with the `k`
of the TD.
I exchanged the 1 and 2 in the last column of `oa1`, that way it looks
closer to `oa0`.
The graph `g0` is actually an affine polar graph, I added it to the
documentation. I tried other constructions mentioned in the Brouwer table
to find ``g1`` but I did not succeed.
Have a look at u/vdelecroix/16370. Tests pass and documentation build so
set to positive review after my commit if you like it.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:45>
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.
