#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: | e469bb5b23d7862b48082f1cba9fd946dd7dc406
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/16370 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Hi Nathann,
As `OrthogonalArrayGraph` is ambiguous, what do you think of
`OrthogonalArrayIntersectionGraph` or `OrthogonalArrayBlockGraph` or
`OrthogonalArrayBlockIntersectionGraph`?
At least, allow the function to be fed with an OA as I suggested in
comment:10.
{{{
def OrthogonalArrayGraph(data, n=None):
if n is not None:
data = int(data)
OA = designs.orthogonal_array(data,n)
else:
assert is_orthogonal_array(data)
OA = data
...
}}}
And, if possible, give examples of two OA with the same parameters that
yield to two different intersection graphs...
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:35>
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.
