Which of these is a complete graph?
Every vertex is connected to every other vertex
Every vertex has degree 2
The graph is connected
There are no cycles