Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then R is not transitive.

Related MCQs

• Define a binary relation R = {(0, 1), (1, 2), (2, 3), (3, 2), (2, 0)} on A = {0, 1, 2, 3}. The directed graph (including loops) of the transitive closure of this relation has
• If a has relation with b and b has relation with c then a has relation with c is………………..Relation.
• Let R be a relation on a set A = {1, 2, 3, 4} given by R = {(1, 1), (1, 2), (1, 3), (2, 1), (2,2), (2, 3), (3, 1), (3, 2), (3, 3)}. Then the relation is:
• Let A = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal elements, and m the number of minimal elements. Which is true?
• A relation that is reflexive, anti-symmetric and transitive is a
• A partial ordered relation is transitive, reflexive and
• The Transitive Closure of a relation R is denoted by----
• Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then R is not reflexive and not symmetric.
• Let N+ denote the nonzero natural numbers. Define a binary relation R on N+ × N+ by (m, n)R(s, t) if gcd(m, n) = gcd(s, t). The binary relation R is
• Let p be “He is tall” and let q “He is handsome”. Then the statement “It is false that he is short or handsome” is: