0 votes 0 votes closed as a duplicate of: GATE CSE 2006 | Question: 71 Registered user 11 asked Jan 14, 2016 • closed Jan 14, 2016 by Registered user 11 Registered user 11 308 views comment Share Follow See 1 comment See all 1 1 comment reply Prateek kumar commented Aug 16, 2016 reply Follow Share [71] there is n node which is single in all subset and 1 empty subset so total "n+1" are not connected to anyone [73] total number of connected components (n+1)+1=n+2 [72] maximum degree of vertex in G will be when a component contain maximum node in which ( n+1 node will not be part bcoz they are not connected to any node rest all will be connected to a node ) I am getting a different answer other than given options,need help in question no 72 ? 0 votes 0 votes Please log in or register to add a comment.