Let $A = \{1, 2, 3\}$. The number of relations on $A$ containing $(1, 2)$ which are symmetric and transitive but not reflexive is . . . . . . .

  • A
    $4$
  • B
    $2$
  • C
    $3$
  • D
    $1$

Explore More

Similar Questions

Let $H$ be the set of all houses in a village where each house is faced in one of the directions,East,West,North,South. Let $R = \{ (x,y) | (x,y) \in H \times H \text{ and } x, y \text{ are faced in same direction} \}$. Then the relation $R$ is

Let $R = \{(a, a)\}$ be a relation on a set $A$. Then $R$ is:

If $R$ is an equivalence relation on a set $A$,then $R^{-1}$ is not :-

Consider the relations $R_1$ and $R_2$ defined as $a R_1 b \Leftrightarrow a^2+b^2=1$ for all $a, b \in R$ and $(a, b) R_2 (c, d) \Leftrightarrow a+d=b+c$ for all $(a, b), (c, d) \in N \times N$. Then:

$x^2 = xy$ is a relation which is

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