Q8.1

MSQMarks unknown

Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$ . Then, which of the following statements are true?

(A)

$G$ has no cycles

(B)

The graph obtained by removing any edge from $G$ is not connected

(C)

$G$ has at least one cycle

(D)

The graph obtained by removing any two edges from $G$ is not connected

(E)

None of the above

Loading…