Q81

MCQ2 marks, −0.5

Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected graph, then the graph $G_1\cup G_2=(V,E_1\cup E_2)$

(A)

cannot have a cut vertex

(B)

must have a cycle

(C)

must have a cut-edge (bridge)

(D)

has chromatic number strictly greater than those of $G_1$ and $G_2$

Loading…