What is largest no of maximal independent set of complete bipartite graph K(4,2)?

Question

What is largest number of maximal independent set of complete bipartite graph K(4,2)?

a)2

b)3

c)4

d)6

Comments

4 is the answer

---

it is given 6 on book

---

Answer should be 4 only.See we know that for bipartite complete graph K_m,n , we can partition the vertex set into 2 sets such that one contains m and other contains n elements(vertices) and within each of this sets there does not exist any edge between any pair of vertices.So it is nothing but independent set.

So for bipartite complete graph K_m,n , we have 2 independent sets.So here max(4,2) = 4.Hence 4 should be the size of largest maximal independent set.

Answer 1

answer should be 4 only which is max(v1,v2) where v1 and v2 are the set of vertices