1

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

Correct Answer: 16 arrows

Make the most of this question

This page focuses on one Discrete Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Discrete Structure (DS) MCQ: 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 | Extra Education