<p>Let $\mathcal{S}$ be the set of all <a href="http://en.wikipedia.org/wiki/Strongly_regular_graph" rel="nofollow">strongly regular graphs</a> with parameter
$(n, k, \lambda, \mu)$. Are there any (interesting) equivalence relations defined on this set? </p>

<p>My motivation is to approach isomorphism partition (equivalence relation is <em>being isomorphic</em>) via other coarser partition.</p>

CC BY-SA 3.0
2012-12-25T05:28:04.133Z
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
CC BY-SA 3.0
2012-12-26T08:27:46.223Z
I am interested in equivalence relation which can be computed in polynomial time AND induce a partition coarser than isomorphism partition.
DurgaDatta
<graph-theory><co.combinatorics><graph-isomorphism><algebra>
Equivalence relations on strongly regular graphs with same parameters
DurgaDatta
# Equivalence relations on strongly regular graphs with same parameters

(Asked by: username_0 on 2012-12-22)

Let $\mathcal{S}$ be the set of all [strongly regular graphs](http://en.wikipedia.org/wiki/Strongly_regular_graph) 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.

**Tags:** graph-theory, co.combinatorics, graph-isomorphism, algebra

> **Comments:**
> **username_1**: 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.  
> **username_0**: I am interested in equivalence relation which can be computed in polynomial time AND induce a partition coarser than isomorphism partition.  

---

## 0 answers

