Consider a simple connected graph G with n vertices and n-edges (n>2). Then,…
GATE · 1993 · CS · Question 8 subparts
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.
Attempted by 13 students.
Sign up free to check your answer
Sign up freeLoading lesson…