GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
292 views

asked in Set Theory & Algebra by Veteran (32.4k points)   | 292 views

2 Answers

+5 votes
Best answer

there are 12 edges : 

answered by Veteran (28.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 (5.5k points)  


Top Users Sep 2017
  1. Habibkhan

    6970 Points

  2. Warrior

    2490 Points

  3. Arjun

    2368 Points

  4. rishu_darkshadow

    2136 Points

  5. A_i_$_h

    2004 Points

  6. nikunj

    1980 Points

  7. makhdoom ghaya

    1760 Points

  8. manu00x

    1750 Points

  9. Bikram

    1744 Points

  10. SiddharthMahapatra

    1718 Points


26,060 questions
33,668 answers
79,747 comments
31,079 users