If a connected graph G does not contain any vertex whose removal disconnects the rest of the graph, then G is called;