Let $\mathcal{S}$ be the set of all strongly regular graphs with parameter $(n, k, \lambda, \mu)$. Are there any (interesting) equivalence relations defined on this set?

My motivation is to approach isomorphism partition (equivalence relation is being isomorphic) via other coarser partition.

  • $\begingroup$ You can imagine any number of equivalence relations on graphs: via chromatic number, clique number, isomorphism, etc. They seem to remain as interesting on this particular restricted set. $\endgroup$ – Lev Reyzin Dec 25 '12 at 5:28
  • 1
    $\begingroup$ I am interested in equivalence relation which can be computed in polynomial time AND induce a partition coarser than isomorphism partition. $\endgroup$ – DurgaDatta Dec 26 '12 at 8:27

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.