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

Answer 1

Each connected component in complement of $\text{K}(m,n)$ is a complete graph, one is $\text{K}_{m},$ another is $\text{K}_{n}.$

So, total number of edges in complement of $\text{K}(m,n)$ is $n(n-1)/2 + m(m-1)/2$

So, A;C;D is correct.

Comments

complement of K(m,n) is always disconnected and  K(m,n) is always connected so why d is correct

---

@ankush8523 Because Option D is saying anyone of the K(m,n) OR its complement is disconnected.    (FOCUS – on the word “OR”)
As we know that comlement of K(m,n) is disconnected. 
So the option D holds the truth.