5. Let A = {a, b, c} , and let R be the relation defined on A 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. 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?
Mathematics Homework Solutions
#214877
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 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?
This provides examples of answering questions about a relation, including ordered pairs, digraphs, properties, Wasrshall's algorithm, and partial order.
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$11.97)
Included in Download
- Plain text response
- Attached file(s):
- 214877.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Ordered Pairs - Describe R by listing the ordered pairs in R and draw the digraph of this relation. See attached file for full problem description.
- Relations and Graph Theory - a)Explain what do you mean by a 'Relation' in Mathematics. b) Create a Binary Relation between X and Y that contains at least 6 Ordered Pairs, given that X and Y are the following: Let the set X ...
- Matrices, Relations and Digraphs - Please see the attached file for the fully formatted problems. 5. Let A = {a, b, c}, and let R be the relation defined on A defined by the following matrix: MR = (a) Describe R by lis ...
- Hasse Diagram : Ordered Pairs and Boolean Matrix - Consider the following Hasse diagram of a partial ordering relation R on a set A: (see attached for image) (a) List the ordered pairs that belong to the relation. (b) Find the (boolean) matrix ...
- 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 ...
