Recently I have been doing practice questions for my Final exam tomorrow and this one question appeared that was interesting, but I couldn't seem to find the other half of the answer to it.
Q: Given the relation $\{(2,2), (3,3)\}$, draw it's associated directed graph and classify the relation.
A: Draw two vertices that have a loop(this is the first half where I draw it of course).
Classification of relation: ?
Does anyone know what this relation would be classified as? I know what the vertices are called, which are referred to as isolated vertex, but what would be relation be classified as?
Without knowing exactly what is meant by "classifying" the relation, I would just answer that the relation is the equality relation over the domain $\{2, 3\}$.
You can throw in the terms reflexive, symmetric, and transitive, as well. But I think "equality" over a domain is pretty precise.