recategorized by
1,679 views
1 votes
1 votes

Consider the graph given below:

The two distinct set of vertices, which make the graph bipartite are

  1. $(v_1, v_4, v_6); (v_2, v_3, v_5, v_7, v_8)$
  2. $(v_1, v_7, v_8); (v_2, v_3, v_5, v_6)$
  3. $(v_1, v_4, v_6, v_7); (v_2, v_3, v_5, v_8)$
  4. $(v_1, v_4, v_6, v_7, v_8); (v_2, v_3, v_5)$
recategorized by

3 Answers

Best answer
4 votes
4 votes

ugc

C is answer.

(v1,v4,v6,v7 ) put these vertex with red color

(v2,v3,v5,,v8) put these vertex with blue color

it can be seen in set Between any two vertex there is direct no edge.

2 votes
2 votes

as we know a graph is bipartite if it can be divided into 2 set of vertices such that each edge in graph joins vertex of one part to vertex of another

let v1v2=a ,v1v3=b , v1v5=c ,v2v4=d ,v2v6=e ,v3v4=f, v3v7=g, v4v8=h ,v5v6=i ,v5v7=j , v6v8=k

option C  is the ans since 

edge a ,b,c,d, e, f, g, h, i, j, k will join vertex of left hand side to r.h.s

v1,v4,v6,v7                         v2 , v3, v5, v8

Answer:

Related questions

1 votes
1 votes
2 answers
2
6 votes
6 votes
2 answers
3
go_editor asked Aug 8, 2016
3,468 views
How many solutions are there for the equation $x+y+z+u=29$ subject to the constraints that $x \geq 1, \: \: y \geq 2 \: \: z \geq 3 \: \: and \: \: u \geq 0$?496026002375...
2 votes
2 votes
1 answer
4