Connectedness

A graph is connected if for each pair of vertices there exists a path that starts in and ends in . A graph that is not connected is disconnected.

A component of a graph is a connected induced subgraph that is maximal. This means that by adding any other vertex from the original graph to this subgraph will cause it to be disconnected. A connected graph has only one component. A disconnected graph has more than one component.

In GrInvIn you can verify if a graph is connected by using the connected invariant.