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

asked in Set Theory & Algebra by Veteran (29.9k points)   | 236 views

2 Answers

+5 votes
Best answer

there are 12 edges : 

answered by Veteran (27.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 Loyal (4.6k points)  


Top Users Apr 2017
  1. akash.dinkar12

    3508 Points

  2. Divya Bharti

    2542 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1588 Points

  8. Arunav Khare

    1454 Points

  9. Kapil

    1424 Points

  10. Arjun

    1420 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,040 answers
63,230 comments
24,135 users