#18948: Strongly Regular Graphs database
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.8
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | 4adcf950cd34c28460383468b17b59c695633f01
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/18948 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
> this comment landed on the wrong ticket (#18960), sorry:
> {{{
> Test if a Paley graph is `(v,k,\lambda,\mu)`-strongly regular.
> }}}
> Huh? Do you mean
> {{{
> Test whether a `(v,k,\lambda,\mu)`-strongly regular graph is Paley.
> }}}
To me your phrasing also sounds incorrect, as it seems to test whether
"any (v,k,l,mu)-strongly regular graph is a Paley graph".
What about replacing 'a' by 'some' or 'any'?
{{{
Test if any Paley graph is (v,k,l,mu)-strongly regular
}}}
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/18948#comment:8>
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.
