3 3 votes The two distinct sets of vertices, which make the graph bipartite are: (A) (v1, v4, v6); (v2, v3, v5, v7, v8) (B) (v1, v7, v8); (v2, v3, v5, v6) (C) (v1, v4, v6, v7); (v2, v3, v5, v8) (D) (v1, v4, v6, v7, v8); (v2, v3, v5) Graph Theory graph-theory bipartite-graph + – sh!va 2.9k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 3 3 votes hope this helps Aboveallplayer answered Aug 9, 2016 • selected Jan 5, 2017 by Aboveallplayer Aboveallplayer comment Share Follow See all 4 Comments 4 4 Comments reply Aboveallplayer commented Aug 9, 2016 reply Follow flag d also does not satisfy 0 0 replyShare focus _GATE commented Aug 10, 2016 reply Follow flag U r correct ! 0 0 replyShare Aboveallplayer commented Aug 10, 2016 reply Follow flag Okay,Thanks 1 1 replyShare rahul rocker commented Jan 5, 2017 reply Follow flag but this is not complete bipartite graph..... 0 0 replyShare Please log in or register to add a comment.
0 0 votes a graph is bipartite if it satisfies 2-colorable properties you can check with above graph so answer will be C.) One answered Sep 19, 2016 One comment Share Follow 0 reply Please log in or register to add a comment.
