2,339 views

2 Answers

Best answer
5 votes
5 votes

there are 12 edges : 

selected by
1 votes
1 votes
Number of edges in any boolean algebra will be n*2^n-2

Where n is number of element.

Number of vertex=2^n

Related questions

2 votes
2 votes
1 answer
1
saumya mishra asked Jul 12, 2018
4,978 views
Let G be the graph defined as the the Hasse diagram for the ⊆ relation on the set P{1,2,...,n}.(n>0).Determine how many edges are there in G.
0 votes
0 votes
0 answers
3
saumya mishra asked Jul 13, 2018
555 views
Let G be the graph defined as the the Hasse diagram for the ⊆ relation on the set P{1,2,...,n}.(n>0).Prove that number of edges in Hasse diagram is n*2^(n-1)????
0 votes
0 votes
2 answers
4
aditi19 asked May 23, 2019
865 views
what is the least upper bound of {a, b, c}?