Category:Disconnected Graphs

This category contains results about Disconnected Graphs.
Definitions specific to this category can be found in Definitions/Disconnected Graphs.

Let $G = \struct {V, E}$ be a graph.

Then $G$ is disconnected if and only if it is not connected.

That is, if and only if there exists (at least) two vertices $u, v \in V$ such that $u$ and $v$ are not connected.