A graph is connected if and only if there is a walk between each pair of vertices. The opposite of a Disconnected Graph.