The empty relation on a set $A$ is

  • A
    Reflexive
  • B
    Symmetric and Transitive
  • C
    Reflexive and Transitive
  • D
    Reflexive and Symmetric

Explore More

Similar Questions

Let the relation $R_{1}$ be defined on $R$ as $a R_{1} b$ if $1+ab > 0$. Then

In order that a relation $R$ defined on a non-empty set $A$ is an equivalence relation,it is sufficient,if $R$

The number of symmetric relations defined on the set $\{1, 2, 3, 4\}$ which are not reflexive is

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

Let $R$ be a relation on the set $A$ of ordered pairs of positive integers defined by $(x, y) R (u, v)$ if and only if $xv = yu$. Show that $R$ is an equivalence relation.

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