7,058 views

6 Answers

Best answer
26 votes
26 votes

Transitive closure of $R$

  1. It is transitive.
  2. It contains $R.$
  3. It is minimal satisfies $1$ and $2.$

$R =  {(1,2),(2,3),(3,4),(5,4)}$

The transitive closure of the relation R = {(1,2),(2,3),(1,3) ,(3,4),(2,4),(1,4),(5,4)}

edited by
33 votes
33 votes

Ans{(1,2),(2,3),(1,3) ,(3,4),(2,4),(1,4),(5,4)}

edited by
24 votes
24 votes
draw a directed graph

Transitive closure can be found using the graph.Include all the pair of vertices for which the path exist in the graph
15 votes
15 votes

The transitive closure of the relation $\left \{ (1,2),(2,3),(3,4),(5,4)\right \}$ =$\left \{ (1,2),(2,3),(1,3) ,(3,4),(2,4),(1,4),(5,4)\right \}$

edited by

Related questions

43 votes
43 votes
2 answers
1
makhdoom ghaya asked Nov 27, 2016
6,403 views
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
25 votes
25 votes
4 answers
2
makhdoom ghaya asked Dec 15, 2016
2,767 views
Find the number of single valued functions from set $A$ to another set $B,$ given that the cardinalities of the sets $A$ and $B$ are $m$ and $n$ respectively.
28 votes
28 votes
4 answers
3
makhdoom ghaya asked Nov 27, 2016
12,785 views
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Virtual memory} & \text{(p)} & \text{ Temporal Locality} \\\hline \text{(B)} & \text{Sha...