   Chapter 8.5, Problem 46ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# Use the algorithm given in the text to find a topological sorting for the relation of exercise 19.

To determine

To find:

A topological sorting for the “ R ” relation on the set s={0,1},

where R is defined by (a,b)R(c,d)ac  and  bd.

Explanation

Given information:

S={0,1}

Concept used:

Hasse Diagram: It is a mathematical diagram representing a partially ordered set with finite number or members. Involving transitive reduction.

Calculation:

The set has a minimal element (0,0), so pick (0,0).

The beginning of the total order is

Total order: (0,0)

Set A1=A={(0,0)}. You can indicate this by removing (0,0) from the Hasse diagram as shown below.

Next, choose the minimal element from A1{(0,0)}. Again, there are two minimal elements (0,1) and (1,0) either one may be chosen

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 