edited by
984 views
2 votes
2 votes

 

edited by

3 Answers

2 votes
2 votes
All four options are correct.

1) consider $K_{2}$

2) Example as given in the other answers

3) consider $K_{2}$

4) consider $C_{6}$
0 votes
0 votes

suitable example for 2,3,4 statement given above:-

every cycle graph with even no. of vertices is bipartite graph.

hence 3 will be the answer.

Related questions

913
views
0 answers
3 votes
Prince Sindhiya asked Nov 11, 2018
913 views
i didn't read the concept related to strongly connected components please it describe it for this question
436
views
1 answers
1 votes
Prince Sindhiya asked Jul 29, 2018
436 views
Prove that every graph with n vertices and k components has atleast n-k edges.
1.4k
views
1 answers
3 votes