- Discrete Math
- Discrete Structures
Hasse Diagram - Ordered Pairs
Please see the attached.
Consider the following Hasse diagram of a partial ordering relation R on a set A:
(a) List the ordered pairs that belong to the relation. Keep in mind that a Hasse diagram is a graph of a partial ordering relation so it satisfies the three properties listed in number 5 part(b).
(b) Find the (Boolean) matrix of the relation.
A Hasse diagram is fully explained in this problem, including a list of the ordered pairs and the Boolean matrix of the relation.