Every tree with at least 2 vertices has at least one cut-vertex.

A cycle graph $C_n$ has no cut-vertices.

A complete graph $K_n$ ($n>2$) has no cut-vertices.

Removing a cut-vertex always disconnects the graph.