## Discussion Forum

Que. | In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is True? |

a. | A tree has no bridge |

b. | A bridge cannot be part of a simple cycle |

c. | Every edge of a clique with size ≥ 3 is a bridge (A clique is any complete subgraph of a graph) |

d. | A graph with bridges cannot have a cycle |

Answer:A bridge cannot be part of a simple cycle |