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

Related MCQs

• The Transitive Closure of a relation R is denoted by----
• 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
• The alternative method to find transitive closure of R* is-------.
• Define a binary relation R on a set A to be anti- reflexive if xRx doesn’t hold for any x 2 A. The number of symmetric, anti-reflexive binary relations on a set of ten elements is
• If a has relation with b and b has relation with c then a has relation with c is………………..Relation.
• A relation that is reflexive, anti-symmetric and transitive is a
• A partial ordered relation is transitive, reflexive and
• Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then R is not transitive.
• The Relation is----------if a has relation with b and b has relation with a.
• Consider the divides relation, m | n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. The cardinality of the covering relation for this partial order relation (i.e., the number of edges in the Hasse diagram) is