We know that graph is connected when there is a path between every pair of vertices. A graph that is not connected is disconnected. A graph G is said to be disconnected if there exist two nodes in G such that no path in G has those nodes as endpoints. A cut vertex is a vertex that when removed (with its boundary edges) from a graph creates more components than previously in the graph.
Do we have a graph that each vertex is a cut vertex??