Number of edges in the Hasse Diagram of a boolean algebra with 8 elements.

Question

Answer 1

there are 12 edges : 

Comments

@amarVashishth yes it is correct. is there any alternate way to solve this question?

---

assign, each element a unique combination of 3bits, there exist an edge between those elements which differs only by a single bit:

---

Thank you

Answer 2

Number of edges in any boolean algebra will be n*2^n-2

Where n is number of element.

Number of vertex=2^n

Comments

It should be n*2^(n-1)

and NOT (n-2) as mentioned by you.