Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
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. – Lev Reyzin Dec 25 '12 at 5:28
I am interested in equivalence relation which can be computed in polynomial time AND induce a partition coarser than isomorphism partition. – DurgaDatta Dec 26 '12 at 8:27

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.