Mathematics Homework Solutions
Problem
#128514

A binary relation R is defined in terms of a given matrix. Determine whether R is a partial order. If it is, draw its Hasse diagram.

For the set A = {a, b, c}, let R be the relation on A which is defined by the following 3 by 3 matrix M_R:

----------------------------------------

Row 1: 1 0 1

Row 2: 1 1 0

Row 3: 0 1 1

-----------------------------------------

Determine whether R is a partial order. If it is, draw its Hasse diagram.

Attached file(s):
Attachments
PartialOrder.doc  View File

Attachment Content Summary (Note: view attachment at the above link before purchasing. Actual attachment content may vary slightly from that shown below.)

PartialOrder.doc
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?

Solution Summary

A detailed determination of whether the given binary relation is a partial order is presented. If it is a partial order, its Hasse diagram is also drawn.

Solution
What is this?
By OTA - Overall OTA Rating
Purchase Cost Now
$2.19 CAD (was ~$3.99)
Included in Download
  • Plain text response
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Reflexive, Antisymmetric and Transitive Properties : Hasse Diagram and Boolean Matrix - Please see the attached file for the fully formatted problems. Let A = {1, 2, 3, 4, 5, 6,12} and define the relation R on A by m R n iff m|n. Write the definitions of the properties, reflexive, a ...
  • Discrete - Let A = {1, 2, 3, 4, 5, 6,12} and define the relation R on A by m R n iff m|n. Write the definitions of the properties, reflexive, antisymmetric and transitive and the use of the definitions to d ...
  • Ordered Pairs - 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 r ...
  • Discrete Structures - Let A = {1, 2, 3, 4, 5, 6, 12} and define the relation R on A by m R n iff m|n. Write the definitions of the properties, reflexive, antisymmetric and transitive and the use the definitions to determ ...
  • Binary relations - Undergraduate senior level Real Analysis. Please show me formal math proofs. Give an example of a binary relation which is - Reflexive and symmetric but not transitive - Reflexive, but neith ...
Browse