A graph is connected if and only if:
It has no isolated vertices.
There is a path between every pair of vertices.
It contains a cycle.
It is a complete graph.