2 votes 2 votes Set Theory & Algebra partial-order + – LeenSharma asked Nov 10, 2015 LeenSharma 2.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes there are 12 edges : amarVashishth answered Nov 11, 2015 selected Nov 11, 2015 by LeenSharma amarVashishth comment Share Follow See all 3 Comments See all 3 3 Comments reply LeenSharma commented Nov 11, 2015 i edited by LeenSharma Nov 11, 2015 reply Follow Share @amarVashishth yes it is correct. is there any alternate way to solve this question? 0 votes 0 votes amarVashishth commented Nov 11, 2015 reply Follow Share assign, each element a unique combination of 3bits, there exist an edge between those elements which differs only by a single bit: 3 votes 3 votes LeenSharma commented Nov 11, 2015 reply Follow Share Thank you 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 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 Paras Nath answered Sep 21, 2016 Paras Nath comment Share Follow See 1 comment See all 1 1 comment reply amytrkpatel commented Jan 3, 2019 reply Follow Share It should be n*2^(n-1) and NOT (n-2) as mentioned by you. 0 votes 0 votes Please log in or register to add a comment.