Let $R= \{(3, 3) (5, 5), (9, 9), (12, 12), (5, 12), (3, 9), (3, 12), (3, 5)\}$ be a relation on the set $A= \{3, 5, 9, 12\}.$ Then, $R$ is
reflexive, symmetric but not transitive.
symmetric, transitive but not reflexive.
an equivalence relation.
reflexive, transitive but not symmetric.
The number of relations $R$ from an $m$-element set $A$ to an $n$-element set $B$ satisfying the condition$\left(a, b_1\right) \in R,\left(a, b_2\right) \in R \Rightarrow b_1=b_2$ for $a \in A, b_1, b_2 \in B$ is
Give an example of a relation. Which is Symmetric but neither reflexive nor transitive.
Determine whether each of the following relations are reflexive, symmetric and transitive:
Relation $\mathrm{R}$ in the set $\mathrm{A}$ of human beings in a town at a particular time given by
$ \mathrm{R} =\{(\mathrm{x}, \mathrm{y}): \mathrm{x}$ and $ \mathrm{y}$ work at the same place $\}$
Let $A=\{0,3,4,6,7,8,9,10\} \quad$ and $R$ be the relation defined on A such that $R =\{( x , y ) \in A \times A : x - y \quad$ is odd positive integer or $x-y=2\}$. The minimum number of elements that must be added to the relation $R$, so that it is a symmetric relation, is equal to $...........$.
Let a set $A=A_{1} \cup A_{2} \cup \ldots \cup A_{k,} \quad$ where $A_{ i } \cap A _{ j }=\phi$ for $i \neq j 1 \leq i , j \leq k$. Define the relation $R$ from $A$ to $A$ by $R=\left\{(x, y): y \in A_{i}\right.$ if and only if $\left.x \in A_{i}, 1 \leq i \leq k\right\}$. Then, $R$ is