On 25 October 2016 12:12:44 AM AEDT, Dima Pasechnik <[email protected]> wrote: >I'd start by checking that the parameters of these strongly regular >graphs >are the same, i.e. comparing > >G2.is_strongly_regular(parameters=True) >G1.is_strongly_regular(parameters=True) > >it could be that you'd need to take the complement, or, even worse, a >graph >coming from the dual (in the S-ring, etc sense) >association scheme. > >In particular, I recall stumbling upon this while working on these >graphs, >and finding out that the formulae here: >http://moodle.tec.hkr.se/~chen/research/2-weight-codes/index.htm >are not always correct.
Thanks, Dima. The strongly regular graph parameters are always the same. The graphs themselves are in some cases not isomorphic. In my next message I will post the relevant output from my code. -- Paul Leopardi https://sites.google.com/site/paulleopardi/ -- You received this message because you are subscribed to the Google Groups "sage-support" 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 https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
