The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

Consider the following set : {1,2,3,.....n}. Now consider all possible subset. Two subset S1 and S2 are having edge between them only if their intersection has two common elements.

a) Number of isolated vertices.
b) Number of components
c) Highest degree possible.


a) n+1
b) n+2
c) 3*2n-3

I have problem in c) part answer.
My answer is 2n - n - 2
My Approach:
I believe Highest degree should be of subset: {1,2,3....n} itself.
as it will be connected to every other vertices across.
It only not connected with single element set, phi and itself.
So its degree is 2n - n - 2 which must be highest.
Please suggest suitable approach to it.

closed as a duplicate of: GATE2006-71
asked in Graph Theory by Active (1.7k points)
retagged by | 152 views

1 Answer

0 votes
Your solution seems correct. But

"intersection has two common elements"

Is it exactly two or at least two?
answered by Veteran (347k points)

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

34,210 questions
40,894 answers
39,793 users