gate2006 [closed]

Question

Comments

[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 ?