\begin{definition}[Definition:Connected (Graph Theory)/Graph/Disconnected]
Let $G$ be a graph.
Then $G$ is '''disconnected''' {{iff}} it is not connected.
That is, if there exists (at least) two vertices $u, v \in G$ such that $u$ and $v$ are not connected.
\end{definition}