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