Mathematics Homework Solutions
Problem
#18542

Relations : Warshall's Algorithm, Digraphs and Connectivity

Please see the attached file for the fully formatted problems.

Let A = {a. b, c, d} and let the relation R be defined on A by the
                   0 0 1 1
matrix MR = 0 1 0 0    Note, take the nodes in A in the order given.
                   0 0 1 0
                   1 0 0 0
(a) Use Warshall' s Algorithm (Section 7.4 of the text) to determine the transitive closure of R.
(b) 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 this mean?

Attached file(s):
Attachments
7.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.)

7.doc
(...continued)

(continued...)





Solution Summary

Transitive closure of a relation is investigated.

Solution
What is this?
By OTA - Overall OTA Rating
Changping Wang, MA - 4.9/5
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
  • Plain text response
  • Attached file(s):
    • digraph.doc
$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
  • Discrete Math: Warshall's Algorithm - Please see the attached file for the fully formatted problems. Let A = {a, b, c, d} and let the relation R be defined on A by the matrix MR = Note, take the nodes in A in the order given Use ...
  • 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 ...
Browse