The relation $R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)\}$ on set $A = \{1, 2, 3\}$ is

  • A
    Reflexive but not symmetric
  • B
    Reflexive but not transitive
  • C
    Symmetric and Transitive
  • D
    Neither symmetric nor transitive

Explore More

Similar Questions

Let $R$ be a relation on $N \times N$ defined by $(a, b) R (c, d)$ if and only if $ad(b-c) = bc(a-d)$. Then $R$ is

The minimum number of elements that must be added to the relation $R = \{(a, b), (b, c)\}$ on the set $\{a, b, c\}$ so that it becomes symmetric and transitive is:

On the set $R$ of real numbers, we define $x P y$ if and only if $x y \geq 0$. Then, the relation $P$ is

Consider the relation $R$ on the set $\{-2, -1, 0, 1, 2\}$ defined by $(a, b) \in R$ if and only if $1 + ab > 0$. Then, among the statements:
$I$. The number of elements in $R$ is $17$
$II$. $R$ is an equivalence relation

Let the relation $\rho$ be defined on $\mathbb{R}$ by $a \rho b$ if and only if $a-b$ is zero or irrational. Then:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo