Explore BrainMass
Share

# Question about Relation - Ordered Pairs

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

See attached

5. Let A = {a, b, c} , and let R be the relation defined on A by the following matrix:
MR =
(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. Use any version you wish.
(e) 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?

© BrainMass Inc. brainmass.com October 25, 2018, 12:03 am ad1c9bdddf

#### Solution Summary

This provides examples of answering questions about a relation, including ordered pairs, digraphs, properties, Wasrshall's algorithm, and partial order.

\$2.19