Let `A={1,\ 2,\ 3}` and `R={(1,\ 2),\ (2,\ 3),\ (1,\ 3)}` be a relation on `A` . Then, `R` is (a)neither reflexive nor transitive (b)neither symmetric nor transitive (c) transitive (d) none of these

Let A={1,\ 2,\ 3} and consider the relation R={(1,\ 1),\ (2,\ 2),\ (3,\ 3),\ (1,\ 2),\ (2,\ 3),\ (1,\ 3)} . Then, R is (a) reflexive but not symmetric (b) reflexive but not transitive (c) symmetric and transitive (d) neither symmetric nor transitive

If A={1, 2, 3} , then a relation R={(2,3)} on A is (a) symmetric and transitive only (b) symmetric only (c) transitive only (d) none of these

Let A={1,\ 2,\ 3} and R={(1,\ 2),\ (1,\ 1),\ (2,\ 3)} be a relation on A . What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A .

If A={1,\ 2,\ 3,\ 4} define relations on A which have properties of being reflexive, transitive but not symmetric.

Show that the relation R on the set A={1,\ 2,\ 3} given by R={(1,\ 2),\ (2,\ 1)} is symmetric but neither reflexive nor transitive.

Let R be the relation on the set A={1,\ 2,\ 3,\ 4} given by R={(1,\ 2),\ (2,\ 2),\ (1,\ 1),\ (4,\ 4),\ (1,\ 3),\ (3,\ 3),\ (3,\ 2)} . Then, R is (a) reflexive and symmetric but not transitive (b) R is reflexive and transitive but not symmetric (c) R is symmetric and transitive but not reflexive (d) R is an equivalence relation

Show that the relation R on the set A={1,\ 2,\ 3} given by R={(1,\ 1),\ (2,\ 2),\ (3,\ 3),\ (1,\ 2),\ (2,3\ )} is reflexive but neither symmetric nor transitive.

Give an example of a relation which is symmetric but neither reflexive nor transitive.

Let R={(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation the set A= {1, 2, 3, 4} . The relation R is (a). a function (b). reflexive (c). not symmetric (d). transitive

Let R be the relation on the set A={1,\ 2,\ 3,\ 4} given by R={(1,\ 2),\ (2,\ 2),\ (1,\ 1),\ (4,\ 4),\ (1,\ 3),\ (3,\ 3),\ (3,\ 2)} . Then, R is reflexive and symmetric but not transitive (b) R is reflexive and transitive but not symmetric (c) R is symmetric and transitive but not reflexive (d) R is an equivalence relation