2 votes 2 votes Graph Theory zeal graph-theory graph-connectivity zeal2019 + – Prince Sindhiya asked Dec 21, 2018 • edited Mar 7, 2019 by ajaysoni1924 Prince Sindhiya 934 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply arvin commented Dec 21, 2018 reply Follow Share 1,2 false 3,4 true. #2statements true 0 votes 0 votes Prince Sindhiya commented Dec 21, 2018 reply Follow Share I also got 3 and 4 as rit 0 votes 0 votes Prince Sindhiya commented Dec 22, 2018 reply Follow Share Arvin bhai they have given its answer 4 0 votes 0 votes Please log in or register to add a comment.
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}$ AngshukN answered May 22, 2022 AngshukN comment Share Follow See all 0 reply Please log in or register to add a comment.
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. Gyanu answered Jun 12, 2019 Gyanu comment Share Follow See all 3 Comments See all 3 3 Comments reply BASANT KUMAR commented Jul 7, 2019 i edited by BASANT KUMAR Jul 7, 2019 reply Follow Share statement no. 2,3,4 is correct. 0 votes 0 votes Gyanu commented Jul 7, 2019 reply Follow Share @BASANT KUMAR how C5 is bipartite graph? 0 votes 0 votes BASANT KUMAR commented Jul 7, 2019 reply Follow Share its my mistake.now corrected. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes all four options are true arun yadav answered Oct 13, 2020 arun yadav comment Share Follow See all 0 reply Please log in or register to add a comment.