You can represent an equivalence class by using a representative from the class, and denoting the entire class by, say, $[(a, b)]$: this represents the set of all ordered pairs $(x, y)$ such that $(x, y) \sim (a, b)$.
So, for a given equivalence relation denoted by $\sim$: one of its equivalence classes can be denoted:
$$[(a, b)] = \{(x, y)\mid (x, y) \sim (a, b)\}$$
If there are many equivalence classes determined by an equivalence relation, and you want to denote the set of equivalence classes, you can list the equivalence classes as elements of a set:
- $\{[(a, b)], [(c,d)], [(e, f)], \cdots [(y, z)]\}$ if there is a finite set of them.
- For example, the set of equivalence classes determined by the equivalence relation of congruence modulo $4$ on the set of integers, you could write $\{[0], [1], [2], [3]\}$,
- or, in the case of an infinite number of equivalence classes, like those corresponding to equality/identity on the natural numbers, one can write $\{[1], [2], [3], \cdots \}$.
If you are asking how to denote a set of different equivalence relations, where the elements of the set are relations, I'm not aware of the standard notation. (That's not to say it doesn't exist.)