Let A = {a, b, c} , and let R be the relation defined on A defined by
the following matrix:
(a) Describe R by listing the ordered pairs in R and draw the digraph
of this relation.
(b) Which of the properties: reflexive, antisymmetric and transitive
are true for the given relation? Begin your discussion by defining each
term in general first and then how the definition relates to this
specific example.
(c) Is this relation a partial order? Explain. If this relation a
partial order, draw its Hasse diagram.
(d) Use Warshall’s Algorithm to determine the transitive closure of
R. Note there are 2 versions of Washall’s Algorithm traditionally
given. Use any version you wish.
Draw the digraph of the transitive closure of R and use the digraph to
explain the idea of connectivity. Is this graph connected? What does
connectivity mean?
