Q324
A connected graph has a maximum of (n - 2) cut vertices.
A.
True
AnswerB.
False
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board