A graph is 'connected' if:
It has no cycles
Every vertex has at least one edge
It is a complete graph
There is a path between every pair of vertices