Any 3-regular graph.

Any graph with $n$ vertices and $n-1$ edges.

A complete graph $K_n$ ($n \geq 3$).

Any bipartite graph with equal partition sizes.