Register

made easy adv mock

203 views
0 votes
0 votes
A graph G is self complementary iff G is isomorphoc to its complement.Let X be a self complementary graph.Which of the following is a viable possibility with regards to connectivity of X and X’ ,where X’ denotes the complement of X?

a)both X and X’ are disconnected

b)X is connected and X’ is disconnected

c)X’ is connected and X’ is disconnected

d)both X and X’ are connected

ans is (d) pls explain
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Gate Fever asked Jan 18, 2019
765 views
made easy adv mock
the number of ways in which we can place 3 white pawns and 3 black pawns on a 3*3 chessboard my answer was 12. approach :- we cant have any 2 black pawns or 2 white pawns in the same row or column {3*2*1} * {2*1 * 1} am i correct??
the number of ways in which we can place 3 white pawns and 3 black pawns on a 3*3 chessboardmy answer was 12.approach :- we cant have any 2 black pawns or 2 white pawns i...
User Avatar
0 votes
0 votes
1 answer
2
Gate Fever asked Dec 16, 2018
1,162 views
made easy adv 2018
The median of n elements can be found in O(logn) time.which one of the following is correct about worst case time complexity of quick sort,if always median is selected as pivot element? a)O(logn) b)O(n) c)O(nlogn) d)O(nloglogn)
The median of n elements can be found in O(logn) time.which one of the following is correct about worst case time complexity of quick sort,if always median is selected a...
User Avatar
Link Copied!