If a connected graph G does not contain any vertex whose removal disconnects the rest of the graph, then G is called:
Show answerHide answer
Correct answer: (A) Biconnected graph
From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)
This is question 192 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.