If `f: R->R` be a relation given by `f = {(a, a), (b, b), (c, c)}`, then (a) `f` is reflexive (b) `f` is symmetric (c) `f` is transitive (d) `f` is equivalence

If A={a,b,c} then the relation R={(a,b),(b,a)} is: (a)Reflexive (b) Symmetric (c) Transitive (d) None of these

Let R be a relation defined by R={(a, b): a >= b, a, b in RR} . The relation R is (a) reflexive, symmetric and transitive (b) reflexive, transitive but not symmetric (c) symmetric, transitive but not reflexive (d) neither transitive nor reflexive but symmetric

The relation ' R ' in NxxN such that (a ,\ b)\ R\ (c ,\ d)hArra+d=b+c is reflexive but not symmetric reflexive and transitive but not symmetric an equivalence relation (d) none of these

The relation ' R ' in NxxN such that (a ,\ b)\ R\ (c ,\ d)hArra+d=b+c is reflexive but not symmetric reflexive and transitive but not symmetric an equivalence relation (d) none of these

R is a relation on the set Z of integers and it is given by (x ,\ y) in RhArr|x-y|lt=1. Then, R is (a) reflexive and transitive (b) reflexive and symmetric (c) symmetric and transitive (d) an equivalence relation

R is a relation on the set Z of integers and it is given by (x ,\ y) in RhArr|x-y|lt=1. Then, R is (a) reflexive and transitive (b) reflexive and symmetric (c) symmetric and transitive (d) an equivalence relation

Let R be a relation defined by R={(a,b):a>=b,a,b in R}. The relation R is (a) reflexive,symmetric and transitive (b) reflexive,transitive but not symmetric ( d) symmetric,transitive but not reflexive (d) neither transitive nor reflexive but symmetric

Let A={a,b,c,d} and f :A->A be given by f={(a,b),(b,d),(c,a),(d,c)} , write f^(-1)

If A={a ,\ b ,\ c} , then the relation R={(b ,\ c)} on A is (a) reflexive only (b) symmetric only (c) transitive only (d) reflexive and transitive only

If R is an equivalence relation on a set A, then R^(-1) is A reflexive only B.symmetric but not transitive C.equivalence D.None of these