edited by
102 views

1 Answer

Best answer
3 votes
3 votes
The topological order for the given hasse diagram is
$a\leq  \_\_ \leq \_\_ \leq d \leq  \_\_ \leq \_\_ \leq \_\_ \leq h.$

The first two blanks can be filled with $b$ and $c$ in any order, so $2!$ ways.

Next three blanks can be filled with $e,f$ and $g$ in any order, so $3!$ ways.

So, total orderings possible $= 2! * 3! = 12.$
selected by
Answer:

Related questions

3 votes
3 votes
1 answer
1
gatecse asked Jul 12, 2020
181 views
If the size (path length) of the longest chain in the following Hasse diagram is denoted by $a$ and that of the longest antichain is denoted by $b,$ then $a+b =$_________...
2 votes
2 votes
1 answer
2
gatecse asked Jul 12, 2020
143 views
Which of the following posets is not a boolean algebra, where $D_n$ is set of all divisors of integer $n$ and $(D_n, /)$ is partial order with division operator?$(D_{10},...