In this case your graphs give rise to Hadamard matrices (take Seidel adjacency matrix), so if you get nonisomorphic Hadamard matrices then you get nonisomorphic graphs, but not the other way around, generally speaking. Although isomorphism of Hadamard matrices is probably harder...
-- 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.
