Two vertices are Connected if there is a Path that connects them A Graph is Connected if for every pair of Vertex there exists a path connecting them A graph is Disconnected if there exists a pair of vertices with no path between them