## Discussion Forum

Que. | Let G1 = (V, E1) and G2 = (V, E2) be connected graphs on the same vertex set V with more than two vertices. If G1 ∩ G2 = (V, E1 ∩ E2) is not a connected graph, then the graph G1 U G2 = (V, E1 U E2) |

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 G1 and G2 |

Answer:must have a cycle |