GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
267 views

asked in Set Theory & Algebra by Veteran (31.6k points)   | 267 views

2 Answers

+5 votes
Best answer

there are 12 edges : 

answered by Veteran (27.9k 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 Loyal (4.8k points)  


Top Users Jul 2017
  1. Bikram

    5784 Points

  2. manu00x

    3602 Points

  3. Arjun

    1988 Points

  4. Debashish Deka

    1924 Points

  5. joshi_nitish

    1908 Points

  6. pawan kumarln

    1680 Points

  7. Tesla!

    1426 Points

  8. Hemant Parihar

    1334 Points

  9. Shubhanshu

    1180 Points

  10. Arnab Bhadra

    1124 Points


24,169 questions
31,187 answers
71,039 comments
29,512 users