#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: | 7b73bc55865f7c7bd454dd047dc38f0ed2ff58be
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/16370 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Replying to [comment:39 ncohen]:
> > You meant `intersection` has no meaning ? It depends on how you see
the blocks.
>
> Nono. I meant that for me "Block" has no meaning there. "intersection"
on the other hand is just wrong. This graph is the intersection graph of a
TD, not the intersection graph of an OA whose rows are not even sets.
>
> > If you consider them as subsets of {0,...,n-1}^k^ then it is the
intersection graph of the blocks.
>
> I would be delighted to hear how you define such an operation, but let's
get this done first.
Sorry, I should have said "disjoint union" instead of "product".
> > > I can relabel an OA. The graphs will be isomorphic but different.
> >
> > Of course, I meant non-isomorphic.
>
> I just finished the job for "different OA". If you want non-isomorphic
OA provide them.
Let me work for a minute.
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:41>
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.
