0 votes 0 votes What is the number of n-vertex labelled graph whose vertex set can be partitioned into parts P and Q with P being a clique Q being a set of isolated vertices? a) 2n b) 2n - n c) 2n - 1 d) None of these Ashwani Kumar 2 asked Jan 28, 2017 Ashwani Kumar 2 505 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Digvijaysingh Gautam commented Jan 28, 2017 reply Follow Share I think C) 0 votes 0 votes Ashwani Kumar 2 commented Jan 28, 2017 reply Follow Share How? 0 votes 0 votes Sushant Gokhale commented Jan 29, 2017 reply Follow Share I can choose in following ways for P: nC1 + nC2 + ...+ nC(n-1) = 2n - 2 0 votes 0 votes Ashwani Kumar 2 commented Jan 29, 2017 reply Follow Share answer given is b) 0 votes 0 votes Please log in or register to add a comment.