If `R` be `a` relation in `a` set `A` and `(x, y) in R rArr(y, x) in R AA x, y in A` then the relation `R` is called
(A) reflexive
(B) symmetric
(C) transitive
(D) equivalence

If a set A has a relation R and (x, y) in R implies (y, x) R AA x,y in A then the relation R is called

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

R={(x y) ): x is brother of y} the relation R is : (A) Symmetric (b) transitive (c) both of these (d) none of these

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

Check whether the relation R in R defined by R={(a,b):a<=b^(3)} is reflexive,symmetric or transitive.

If R and R' are symmetric relations (not disjoint) on a set A ,then the relation R uu R' is (i) Reflexive (ii) Symmetric (ii) Transitive (iv) none of these

Check whether the relation R on R defined by R={(a,b):a<=b^(3)} is reflexive,symmetric or transitive.

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 w denote the words in the english dictionary. Define the relation R by: R = {(x,y) in W xx W | words x and y have at least one letter in common}. Then R is: (1) reflexive, symmetric and not transitive (2) reflexive, symmetric and transitive (3) reflexive, not symmetric and transitive (4) not reflexive, symmetric and transitive