2 votes 2 votes Which of the following statements are correct? The complement of a simple disconnected graph must be connected. The complement of a simple connected graph must be disconnected. The complement of complete bipartite graph $\text{K}(4,6)$ has $10$ components. 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.$ Graph Theory goclasses2024-dm-5-weekly-quiz goclasses graph-theory graph-isomorphism multiple-selects 2-marks + – GO Classes asked May 11, 2022 edited May 27, 2023 by Lakshman Bhaiya GO Classes 255 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 : GO Classes answered May 11, 2022 edited May 11, 2022 by Lakshman Bhaiya GO Classes comment Share Follow See all 0 reply Please log in or register to add a comment.