Definition:Connected (Graph Theory)/Graph/Disconnected

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

Then $G$ is disconnected it is not connected.

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