Chapter 9: Q22E (page 616)
Suppose that the relation\(R\)is reflexive. Show that\({R^*}\)is reflexive.
Short Answer
\({R^*}\) is reflexive.
Chapter 9: Q22E (page 616)
Suppose that the relation\(R\)is reflexive. Show that\({R^*}\)is reflexive.
\({R^*}\) is reflexive.
All the tools & learning materials you need for study success - in one app.
Get started for freeTo prove that \(R\) is reflexive if and only if \({R^{ - 1}}\) is reflexive.
Findfor the given .
What is the covering relation of the partial ordering \(\{ (a,b)\mid a\) divides \(b\} \) on \(\{ 1,2,3,4,6,12\} \).
Let \(A\) be the set of students at your school and \(B\) the set of books in the school library. Let \({R_1}\) and \({R_2}\) be the relations consisting of all ordered pairs \((a,b)\), where student \(a\) is required to read book \(b\) in a course, and where student \(a\) has read book \(b\), respectively. Describe the ordered pairs in each of these relations.
a) \({R_1} \cup {R_2}\)
b) \({R_1} \cap {R_2}\)
c) \({R_1} \oplus {R_2}\)
d) \({R_1} - {R_2}\)
e) \({R_2} - {R_1}\)
To find the transitive closers of the relation \(\{ (a,c),(b,d),(c,a),(d,b),(e,d)\} \) with the use of Warshall’s algorithm.
What do you think about this solution?
We value your feedback to improve our textbook solutions.