Let A = {a, b, c} and a relation on A is defined by R = {(a, a), (a, b), (a, c), (b, b), (c, c)}.
Then the transitive clousre of R is :

¯ ¯¯ ¯ R

No worries! We‘ve got your back. Try BYJU‘S free classes today!

R = {(a, a), (a, b), (b, c), (a, c), (b, b), (c, c)}.

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

A \times A

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C R
option (a)

The given relation is transitive.
Therefore, the transitive closure of R = R.

Suggest Corrections

Similar questions

Q. Let

A = {a, b, c}

and the relation

R

be defined on

A

as follows

R = {(a, a), (b, c), (a, b)}

. Then write minimum number of ordered pairs to be added in

R

to make it reflexive and transitive.

Q. Let

A = {1, 2, 3, 4}

and the relation

R

on set

A

is defined as

R = {(a, b) : a + b = 10} .

Then

R

Q. Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}.
Then, the minimum number of ordered pairs to be added in R to make it reflexive and transitive, is

Let A ={a,b,c} and the relation R be defined on A as follows.
R ={(a,a),(b,c),(a,b)}

Then, write the ordered pairs to be added in R to make R reflexive and transitive.

Join BYJU'S Learning Program

Let A = {a, b, c} and a relation on A is defined by R = {(a, a), (a, b), (a, c), (b, b), (c, c)}. Then the transitive clousre of R is :

The correct option is C Roption (a) The given relation is transitive. Therefore, the transitive closure of R = R.

Let A = {a, b, c} and a relation on A is defined by R = {(a, a), (a, b), (a, c), (b, b), (c, c)}.
Then the transitive clousre of R is :

The correct option is C R
option (a)

The given relation is transitive.
Therefore, the transitive closure of R = R.