The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
354 views

asked in Set Theory & Algebra by Veteran (37.6k points) | 354 views

2 Answers

+5 votes
Best answer

there are 12 edges : 

answered by Veteran (29.7k points)
selected by
@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 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
answered by Boss (6.1k points)


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

28,831 questions
36,676 answers
90,577 comments
34,638 users