edited by
355 views
4 votes
4 votes

Let $\text{K}(4,6)$ be the complete bipartite graph on $10$ vertices, having $4$ vertices in one part and having $6$ vertices in another part. Which of the following is/are true?

  1. Number of edges in the complement of $\text{K}(4,6)$ is $21.$
  2. The number of connected components in the complement of $\text{K}(4,6)$ is $1.$
  3. Each connected component in the complement of $\text{K}(4,6)$ is a complete graph.
  4. Either $\text{K}(m,n)$ OR complement of $\text{K}(m,n)$ is dis-connected.
edited by

1 Answer

4 votes
4 votes
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.
Answer:

Related questions