A graph with a unique degree sequence

2-regular. Every vertex has exactly $2$ neighbors.

Structure. Starting from any vertex, follow one neighbor; each vertex has exactly one other neighbor to continue to, forcing a cycle. Connected 2-regular on $5$ vertices = $C_5$.

Conclusion. The only 2-regular graph on $5$ vertices is $C_5$.