in Graph Theory edited by
460 views
3 votes
3 votes

Which of the following statements are correct?

  1. The complement of a simple disconnected graph must be connected.
  2. The complement of a simple connected graph must be disconnected.
  3. The complement of complete bipartite graph $\text{K}(4,6)$ has $10$ components.
  4. If $\text{G}$ is a self-complementary graph i.e. $\text{G}$ is isomorphic to its complement. Then $\text{G}$ must have $4k$ or $4k + 1$ vertices for some integer $k.$
in Graph Theory edited by
460 views

2 Comments

Does option 3 will give 2 components?

As 2 sets itself will get connected.
1
1
YES there will be 2 Connected component.
0
0

1 Answer

1 vote
1 vote

A is true. Below is the proof of it :



D is true because the number of edges in a self-complementary graph is as following :


Answer:

Related questions

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