Correct answer: (B) A bridge cannot be part of a simple cycle
Explanation
If an edge lies on a cycle, the rest of that cycle still connects its endpoints after removal, so it cannot be a bridge. Thus B. Every tree edge is a bridge; clique edges lie on cycles; and a graph may contain a cycle with a bridge leading to another component.
More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions
GATE 2026 CS (CS1) Q55– An undirected, unweighted, simple graph G(V, E) is said to be 2-colorable if there exists…
GATE 2026 CS (CS2) Q36– Consider a complete graph K n with n>4 vertices. Each spanning tree of K n is represented…
GATE 2024 CS (CS1) Q34– The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is
GATE 2024 CS (CS1) Q51– The chromatic number of a graph is the minimum number of colours used in a proper…
GATE 2024 CS (CS2) Q17– Let A be the adjacency matrix of a simple undirected graph G. Suppose A is its own…
GATE 2024 CS (CS2) Q51– Let G be an undirected connected graph in which every edge has a positive integer weight.…