Register
Dark Mode

GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 22

in Graph Theory edited by
263 views
2 votes
2 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
by
263 views

1 Answer

3 votes
3 votes

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 :


edited by
by
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!