The Gateway to Computer Science Excellence
+2 votes
713 views

in Set Theory & Algebra by Boss | 713 views

2 Answers

+5 votes
Best answer

there are 12 edges : 

by Boss
selected by
0
@amarVashishth yes it is correct. is there any alternate way to solve this question?
+3

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

0

Thank yousmiley

0 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
by Boss
0
It should be n*2^(n-1)

and NOT (n-2) as mentioned by you.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,223 questions
59,811 answers
201,020 comments
118,087 users